January 3, 2017 by Chris on Web Bookmarks

Bookmarks for January 3rd

April 25, 2016 by Chris on Web Bookmarks

Bookmarks for April 24th through April 25th

These are my links for April 24th through April 25th:

April 11, 2016 by Chris on Web Bookmarks

paulcuth/starlight: A Lua to ES6 transpiler. –
The Local SEO Checklist – Moz – Don't scrape content from other websites, even from the websites of manufacturers or authorities, unless you are publishing an attributed quote within your own, unique content.
If you offer the same services or products in multiple cities, think carefully about attempting to create a unique page for every possible city/keyword combination. Only embark on this plan if you know you have sufficient resources of time, money, and talent to create truly high-quality pages for each combination. Avoid publishing thin or useless pages. If you know you don't have the resources, it's better to go with just a strong page for each city and a strong page for each service, rather than creating lots of thin or duplicate city/keyword combo pages. See this complete resource on developing city landing pages.
[OC] If I Only Had 2 Hours to Practice Per Week : Guitar –

March 13, 2016 by Chris on Web Bookmarks

February 10, 2016 by Chris on Web Bookmarks

These are my links for February 9th through February 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