July 7, 2017 by Chris on Web Bookmarks

Bookmarks for July 6th through July 7th

These are my links for July 6th through July 7th:

June 23, 2017 by Chris on Web Bookmarks

Bookmarks for June 21st through June 23rd

These are my links for June 21st through June 23rd:

May 15, 2017 by Chris on Web Bookmarks

April 26, 2017 by Chris on Web Bookmarks

These are my links for April 25th through April 26th:

A Primer on Bézier Curves – So, what if you need to program them yourself? What are the pitfalls? How do you draw them? What are the bounding boxes, how do you determine intersections, how can you extrude a curve, in short: how do you do everything that you might want when you do with these curves? That's what this page is for. Prepare to be mathed!
BBC – Earth – Sheep are not stupid, and they are not helpless either –
Announcing Linkerd 1.0 –
Is Every Speed Limit Too Low? –

April 6, 2017 by Chris on Web Bookmarks

These are my links for April 5th through April 6th:

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