May 3, 2017 by Chris on Web Bookmarks

Bookmarks for May 3rd

Homebrew Amiga Graphics Card (FPGA, Open Source) Finished | Hacker News –
Kodi | Open Source Home Theater Software –
Getting Started with Functional Programming in F# | Hacker News –
Functional ASP.NET Core – Dusted Codes –
Structured Procrastination: Do Less and Deceive Yourself | Hacker News –
Poem About Distance In Marriage, These 13 Years –
Is your programming language unreasonable? | F# for fun and profit –
This Is What Happens to Your Body on a Thru-Hike | Outside Online –
What Happens to Your Body on a Thru-Hike | Hacker News –
Tour of F# | Hacker News –
Tour of F# | Microsoft Docs – The best way to learn about F# is to read and write F# code. This article will act as a tour through some of the key features of the F# language and give you some code snippets that you can execute on your machine. To learn about setting up a development environment, check out Getting Started.+
There are two primary concepts in F#: functions and types. This tour will emphasize features of the language which fall into these two concepts.
APIs, robustness, and idempotency | Hacker News –
Review of “Adults in the Room” by Yanis Varoufakis | Hacker News –

May 1, 2017 by Chris on Web Bookmarks

Bookmarks for April 30th through May 1st

These are my links for April 30th through May 1st:

April 22, 2017 by Chris on Web Bookmarks

Bookmarks for April 21st through April 22nd

These are my links for April 21st through April 22nd:

August 30, 2016 by Chris on Web Bookmarks

Bookmarks for August 30th

Calm Technology –
Why is exercise hard? | Harvard Magazine –
Etcher by resin.io –

July 11, 2016 by Chris on Web Bookmarks

Bookmarks for July 10th

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