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
Read more
Current reading
Wadler’s influential “monads” paper for Haskell. It seems like a classic case of making something simple sound profound and mysterious. And companion paper by Hughes
Read moreChang-Maxemchuk atomic broadcast
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 way than some
Read moreTime out of joint
Financial trading venues and trading systems operate so quickly and rely on clocks so deeply that events like the one noted in this FINRA report
Read moreData base design criteria: ease of use
Regarding ease-of-use, it’s often struck me when reviewing data systems papers that the evaluation sections are full of performance and correctness criteria, but only rarely
Read moreDistributed consensus and network reliability
All of the distributed consensus algorithms I have been reviewing recently (Paxos, Raft, Zab, Chang Maxemchuck, Viewstamped, … ) are based on a number of
Read more
The replicated state machine method of fault tolerance from 1980s
The first time I saw this method was when I went to work for Parallel Computer Systems, , later called Auragen, in the famous tech startup
Read morecircularity problems in distributed consensus
Distributed consensus involves organizing a collection of independent agents – processes or network sites – to agree on some value or sequence of values. Many
Read morestate equations in practice
When people think of mathematical models of state for programs and other computer systems, it’s natural and conventional to consider state as a map
Read moreState equations
Download paper. Unable to display
Read more