Understanding Distributed Calculi in Haskell
summary
Clear claim: pi calculus and rho calculus are mapped to Haskell examples using distributed-process (Cloud Haskell); live ping‑pong code runs but exposes practical traps. Built demos (spawn, send, expect) and a Lamport logical clocks implementation that fails when messages violate protocol because expect is untyped and mailboxes accept any serializable value. Tried to write a pi→Cloud‑Haskell interpreter and finds it undoable due to send/receive port asymmetry and name/consensus complications.
AI-written summary · about
chapters (5)
related talks
13mTyped Abstractions for Causal Probabilistic Programming
51mPragmatism, Puritanism and Functional Programming
24mQuantum Computing Modeling in Scala
24mHigher order programming with probabilistic effects: A model of stochastic memo...
01h 04mSymbolic Calculus for High-performance Computing From Scratch Using C++23
19mIncremental Computation for Efficient Programmable Inference in Probabilistic Programs
27mEffectful
39mA Lazy Scheme In Haskell