April 14, 2017 by Chris on Web Bookmarks

Bookmarks for April 13th through April 14th

These are my links for April 13th through April 14th:

How to Deploy a Flask Python App for Cheap. | Minimal Cyborg –
GitHub – gurugio/lowlevelprogramming-university: How to be low-level programmer – 80×86 Assembly programming
Hardware device with Atmel chip and firmware
C language system programming for Unix
Device driver in Linux
Linux kernel: page allocation
Linux kernel: block device driver and md module
Programming in the Point-Free Style | Hacker News –

February 9, 2017 by Chris on Web Bookmarks

Bookmarks for February 9th

November 10, 2016 by Chris on Web Bookmarks

Bookmarks for November 10th

November 10, 2016 by Chris on Web Bookmarks

Bookmarks for November 9th through November 10th

These are my links for November 9th through November 10th:

July 6, 2016 by Chris on Web Bookmarks

Bookmarks for July 5th through July 6th

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

75+ Awesome Tools for Designers — Medium – <blockquote>🎨 Pick Colors</blockquote>
How well do you know CSS display? – <blockquote>The display property is one of the most important CSS properties we use for layout. Most of us would have used block, inline and none. table and inline-block…</blockquote>
javascript – Is it possible to apply CSS to half of a character? – Stack Overflow –
GitHub – mozilla/positron: Electron-compatible runtime on top of Gecko – <blockquote>positron – Electron-compatible runtime on top of Gecko</blockquote>
Unpleasant Design & Hostile Urban Architecture – 99% Invisible –
Wooley v. Maynard – Wikipedia, the free encyclopedia –
The Meaning of July Fourth for the Negro by Frederick Douglass –

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