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 –

January 25, 2016 by Chris on Web Bookmarks

Bookmarks for January 25th

github/swift-style-guide: Style guide & cod… – GitHub – <blockquote>swift-style-guide – Style guide & coding conventions for Swift projects</blockquote>
A Whig History of CRISPR | Genotopia –
The Villain of CRISPR –

December 4, 2015 by Chris on Web Bookmarks

Bookmarks for December 3rd through December 4th

These are my links for December 3rd through December 4th:

IBM Swift Sandbox –
SPF – <blockquote>A lightweight JS framework for fast navigation and page updates from YouTube</blockquote>
Meal frequency and timing in health and disease –
Callback Hell –
Jury Duty — Medium –

November 21, 2015 by Chris on Web Bookmarks

Bookmarks for November 21st

November 6, 2015 by Chris on Web Bookmarks

Bookmarks for November 5th through November 6th

These are my links for November 5th through November 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