May 26, 2017 by Chris on Web Bookmarks

Bookmarks for May 25th through May 26th

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

11 years ago I got a $428 million dollar lesson when I was fired from Facebook as employee #30. I went on to build two multi-million dollar companies including Sumo.com and AppSumo, which I started on Reddit. I’m Noah Kagan and I LOVE tacos, AMA! : Entr –
traintimes.org.uk performance notes –
How to build your own VPN if you’re wary of commercial options | Hacker News –
memononen/nanovg: Antialiased 2D vector drawing library on top of OpenGL for UI and visualizations. –

May 21, 2017 by Chris on Web Bookmarks

Bookmarks for May 20th through May 21st

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

May 9, 2017 by Chris on Web Bookmarks

Bookmarks for May 8th through May 9th

These are my links for May 8th through May 9th:

May 3, 2017 by Chris on Web Bookmarks

Bookmarks for May 3rd

How to start a startup without ruining your life – Blog – SuperHi –
Troubling chemicals found in wide range of fast-food wrappers – The Verge –
Preventing Alzheimer’s Disease Is Easier Than You Think | Psychology Today –
Ask HN: Successful one-person online businesses? | Hacker News –
A practical introduction to functional programming (2013) | Hacker News –
Listen to DJ Sets, Mixes, Tracks and Sounds | hearthis.at –
Grim’s Scythe — Hopac: Getting Started with Jobs – Hopac is a unique library that offers lightweight threading along with a host of other valuable concurrency constructs, all of which make it easier to write highly-concurrent software.
ha4: Concurrent ML and HOPAC –
Developer experience –
The lost art of 3D rendering without shaders –
Lispy sets | Hacker News –
How Does the SQL Server Query Optimizer Work? | Hacker News –

May 2, 2017 by Chris on Web Bookmarks

Bookmarks for May 2nd

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