Current reading: July 8 2017

July 8, 2017 | 0 Comments

Principal type-schemes for functional programs∗ Luis Damas† and Robin Milner First published in POPL ’82: Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on [...]

Types considered harmful

June 10, 2017 | 0 Comments

Russell introduced what is often viewed as his most original contribution to mathematical logic: his theory of types—which in essence tries to distinguish between sets, [...]

Basic math for basic algorithms

June 9, 2017 | 0 Comments

It’s odd that all the descriptions of basic programming operations, such as sorting, rely on pseudo code or complex formal logic. All we are doing is modifying finite [...]

undefined behavior and the purpose of C

January 5, 2017 | 0 Comments

C undefined behavior. From one of the LLVM developers: This behavior enables an analysis known as “Type-Based Alias Analysis” (TBAA) which is used by a broad [...]

Computer Science as a scholarly discipline.

December 22, 2016 | 1 Comment

Google Scholar tells me that “Why Functional Programming Matters” was published in 1989 and has been cited over 1000 times. Here’s a quote.  Recall that a [...]

Current reading

December 8, 2016 | 0 Comments

Wadler’s influential “monads” paper for Haskell. It seems like a classic case of making something simple sound profound and mysterious.  And companion [...]

Understanding Paxos and Distributed Consensus

October 1, 2016 | 2 Comments

(minor wording correction and more complaining added 10/2/2016, minor edits 10/5/2016) Multi-proposer Paxos is a very clever and notoriously slippery algorithm for obtaining [...]

Chang-Maxemchuk atomic broadcast

September 2, 2016 | 0 Comments

The Chang-Maxemchuk algorithm (US Patent 4,725,834 ) solves atomic broadcast (and in-order broadcast) problems for distributed networks in a far simpler and more efficient [...]
1 2 3 4 41