September 6, 2015 by Chris on Web Bookmarks

Bookmarks for September 5th through September 6th

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

August 26, 2015 by Chris on Web Bookmarks

Bookmarks for August 23rd through August 26th

These are my links for August 23rd through August 26th:

Day8/re-frame · GitHub –
Closures – JavaScript | MDN – Closures are functions that refer to independent (free) variables. In other words, the function defined in the closure 'remembers' the environment in which it was created.
Linear Regression – Practice – The Physics Hypertextbook –
Accounting for Developers 102 –
WinLister v1.21 – display the list of opened windows on your system –
jeanphix/Ghost.py · GitHub –
FFI Library –
Free Mumble Server Hosting — GuildBit.com –
Clojure by Example –
sshtalk | 2 Ton Digital –
c : Where the printf() Rubber Meets the Road –
i-open-sourced-my-phaser-html5-game –
Reagent: Minimalistic React for ClojureScript –
DataTau –
Skimfeed V5 – Tech News –
hackurls – news for hackers and programmers –
talll.com – the ultimate reading list for technology professionals –
Association of Dietary, Circulating, and Supplement Fatty Acids With Coronary Risk: A Systematic Review and Meta-analysis | Annals of Internal Medicine –
Favorites –
A trip through the Graphics Pipeline 2011, part 1 | The ryg blog –
Pannellum –
The Secret Life of Cheese – Roads & Kingdoms –
NAND Flash: Dealing With a Flawed Medium –

June 21, 2015 by Chris on Web Bookmarks

Bookmarks for June 21st

June 9, 2015 by Chris on Web Bookmarks

Bookmarks for June 8th through June 9th

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

May 22, 2015 by Chris on Web Bookmarks

Bookmarks for May 22nd

Shopify eCommerce | Drupal.org –
Shellcode – Exploit Development Community –
Famous.org –

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