academics

Bad ideas in type theory

September 15, 2017 | 0 Comments

Types as sets and subtypes as subsets.  This may be due to confusing usage in mathematical practice where, for example, we often see references to integers as a subset of [...]

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 [...]

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 [...]

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 [...]

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 [...]

Distributed consensus and network reliability

August 30, 2016 | 0 Comments

All of the distributed consensus algorithms I have been reviewing recently (Paxos, Raft, Zab, Chang Maxemchuck, Viewstamped, … ) are based on a number of assumptions [...]
1 2 3 5