Elgot’s Analysis of Monadic Computation
Stephen L. Bloom · Fundamenta Informaticae · 1982
A review is given of some of the late C.C. Elgot’s ideas on the syntax and semantics of monadic flowchart algorithms. In particular, the motivation for his “iterative algebraic theories” is explained.