Answers are grounded in this paper and cite their sources.
The Paxos consensus protocol can be specified concisely, but is notoriously difficult to implement in practice. We recount our experience building Paxos in Overlog, a distributed declarative programming language. We found that the Paxos algorithm is easily translated to declarative logic, in large part because the primitives used in consensus protocol specifications map directly to simple Overlog constructs such as aggregation and selection. We discuss the programming idioms that appear frequently in our implementation, and the applicability of declarative programming to related application domains.
No takes yet. Share an insight, caveat, or question.
Alvaro et al. (2010) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: