January 22, 2017 by Chris on Web Bookmarks

Bookmarks for January 21st through January 22nd

These are my links for January 21st through January 22nd:

January 21, 2017 by Chris on Web Bookmarks

Bookmarks for January 20th through January 21st

These are my links for January 20th through January 21st:

BROOMWAY – Walking the Broomway is exceptionally dangerous, because navigation in such self-similar terrain is difficult even in good conditions of visibility, and because the tide comes in extremely fast. It is quite easy to get lost on Maplin Sands, and if a walker gets lost out there he or she is almost certain to drown. So two things are absolutely crucial to a Broomway expedition: a compass, and tide times.
Peloton – The Self-Driving Database Management System –
mjhea0/flaskr-tdd: Flaskr: Intro to Flask, Test Driven Development (TDD), and jQuery –

January 20, 2017 by Chris on Web Bookmarks

January 18, 2017 by Chris on Web Bookmarks

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