Lecture 21: Monadic Array.

We continue our discussion on monads. In particular, we show how monads can be used to mimic memory. A heap is nothing else but an array (and its update history), and passed along evaluation in form of a mondadic construction.

Philip Wadler. In M. Broy, editor, Marktoberdorf Summer School on Program Design Calculi, Springer Verlag, NATO ASI Series F: Computer and systems sciences, Volume 118, August 1992. Also in J. Jeuring and E. Meijer, editors, Advanced Functional Programming, Springer Verlag, LNCS 925, 1995.