September 26, 2015 by Chris on Web Bookmarks

Bookmarks for September 22nd through September 26th

These are my links for September 22nd through September 26th:

September 14, 2015 by Chris on Web Bookmarks

Bookmarks for September 13th through September 14th

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

September 10, 2015 by Chris on Web Bookmarks

Parsing pdf files with Python and PDFMiner | Quant Corner –
Manipulating PDFs with Python – Tutorial – Binpress – <blockquote>There are some nasty PDFs out there, but there are several tools you can use to get what you need from them. Python enables you to get inside and scrape, split, merge, delete, and crop just about whatever you find, and I'll show you how.</blockquote>
dpapathanasiou/pdfminer-layout-scanner · GitHub – <blockquote>pdfminer-layout-scanner – A more complete example of programming with PDFMiner, which continues where the default documentation stops</blockquote>
The Hardest Program I’ve Ever Written – journal.stuffwithstuff.com –
Lovefield – Lovefield is a relational database for web apps.
It is written in JavaScript and works cross-browser.
It provides SQL-like APIs that are fast, safe, and easy to use.

September 6, 2015 by Chris on Web Bookmarks

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

August 22, 2015 by Chris on Web Bookmarks

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