April 8, 2016 by Chris on Web Bookmarks

Bookmarks for April 8th

How to build a CRUD application using Flask (Python Framework) — Python, Flask, Django Tutorials and Tips — Medium –
GitHub – tcard/sgo: A dialect of Go with optional types and without nil references. – <blockquote>sgo – A dialect of Go with optional types and without nil references.</blockquote>
Tools to Learn JavaScript By Doing -Telerik Developer Network – <blockquote>Raymond Camden explores a variety of tools and sites that offer code puzzles with the goal of teaching programming skills in JavaScript.</blockquote>

March 30, 2016 by Chris on Web Bookmarks

Bookmarks for March 30th

Table for one: How to play board games without a group | Ars Technica – <blockquote>From solo games to apps and virtual tabletops, there's a world of options.</blockquote>
Evolution of Webdesign –
What can a technologist do about climate change? A personal view. –
GitHub – lukebuehler/CShell: A simple, yet powerful, C# scripting IDE and REPL –
C# REPL | Mono –
A Large Dataset of Object Scans –
Refurbishing A 1927 Switchboard, Part 1: Wiring –
expired at the daytona 500 | Redlights and Redeyes –
EC2 for Poets –
TensorFlow for Poets « Pete Warden’s blog –
Beyond the sea | Andy Woodruff –

March 19, 2016 by Chris on Web Bookmarks

Bookmarks for March 19th

The Secrets of the Wave Pilots – The New York Times –
Learning Rust –
10M – goroutines –
Australian Grand Prix – Lensaloft –

March 19, 2016 by Chris on Web Bookmarks

Bookmarks for March 18th through March 19th

These are my links for March 18th through March 19th:

March 13, 2016 by Chris on Web Bookmarks

Bookmarks for March 13th

These are my links for July 20th through July 24th:

Ask HN: Best-architected open-source business applications worth studying? | Hacker News -
Monospaced Programming Fonts with Ligatures | Hacker News -
The language of choice - Propositional logic was discovered by Stoics around 300 B.C., only to be abandoned in later antiquity and rebuilt in the 19th century by George Boole’s successors. One of them, Charles Peirce, saw its significance for what we now call logic circuits, yet that discovery too was forgotten until the 1930s. In the ’50s John McCarthy invented conditional expressions, casting the logic into the form we’ll study here; then in 1986 Randal Bryant repeated one of McCarthy’s constructions with a crucial tweak that made his report “for many years the most cited paper in all of computer science, because it revolutionized the data structures used to represent Boolean functions” (Knuth).1 Let’s explore and code up some of this heritage of millennia, and bring it to bear on a suitable challenge: playing tic-tac-toe.
Then we’ll tackle a task that’s a little more practical: verifying a carry-lookahead adder circuit. Supposedly logic gets used all the time for all kinds of serious work, but for such you’ll have to consult the serious authors; what I can say myself, from working out the code to follow, is that the subject offers a fun playground plus the most primitive form of the pun between meaning and mechanism.

You’re encouraged to read with this article’s code cloned and ready