Abstract

Category theorists invented monads in the 1960’s to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970’s to concisely express certain programs involving lists. This paper shows how list comprehensions may be generalised to an arbitrary monad, and how the resulting programming feature can concisely express in a pure functional language some programs that manipulate state, handle exceptions, parse text, or invoke continuations. A new solution to the old problem of destructive array update is also presented. No knowledge of category theory is assumed. 1

Citations

1497	The Definition of Standard ML - Milner, Tofte, et al. - 1990
1225	The essence of functional programming - Wadler - 1992
815	Categories for the Working Mathematician - Lane - 1971
515	The Implementation of Functional Programming Languages - Jones - 1987
401	Computational lambda-calculus and monads - Moggi - 1989
379	Introduction to higher order categorical logic - Lambek, Scott - 1986
369	Category Theory for Computing Science - Barr, Wells - 1990
332	Types, abstraction and parametric polymorphism - Reynolds - 1983
292	Theorems for free - Wadler - 1989
265	Why functional programming matters - Hughes - 1989
219	Call-by-name, call-by-value, and the -calculus - Plotkin - 1975
205	An introduction to the theory of lists - Bird - 1987
174	Call-by-name, call-by-value and the λ-calculus - Plotkin - 1976
135	Miranda—a non-strict functional language with polymorphic types - Turner - 1996
122	Linear types can change the world - Wadler - 1990
107	Continuation-passing, closure-passing style - Appel, Jim - 1989
95	Algorithmics: Towards programming as a mathematical activity - Meertens - 1986
85	Is there a use for linear logic - Wadler - 1991
83	How to replace failure by a list of successes - Wadler - 1985
72	Integrating functional and imperative programming - Gifford, Lucassen - 1986
71	Single-threaded polymorphic lambda calculus - Guzman, Hudak - 1990
61	editors, Report on the programming language Haskell, a non-strict purely-functional programming language, Version 1.2. Sigplan Notices 27(5 - Hudak, Jones, et al. - 1992
56	Detecting global variables in denotational specifications - Schmidt - 1985
44	On the relation between direct and continuation semantics - Reynolds - 1974
39	A functional theory of exceptions - Spivey - 1990
34	Recursion equations as a programming language - Turner - 1981
33	The definition of Standard ML (version 2 - Harper, Milner, et al. - 1988
31	Update analysis and the efficient implementation of functional aggregates - Bloss - 1989
31	Expressing and reasoning about non-deterministic functional programs - Hughes, O'Donnel - 1989
25	A semantic model of reference counting and its abstraction (detailed summary - Hudak - 1986
23	Constructing natural language interpreters in a lazy functional languages - Frost, Launchbury - 1989
16	A categorical approach to the theory of lists - Spivey - 1989
8	Higher order functions considered unnecessary for higher order programming - Goguen - 1988
5	editors). Report on the functional programming language Haskell - Hudak, Wadler - 1988
4	non-determinism, side-effects, and parallelism: a functional perspective (extended abstract - Arrays - 1987
3	Form follows function - Fairbairn - 1987
3	A simple and efficient way to handle large data structures in applicative languges - Holmstrom - 1983
3	An abstract view of programming languges. Course notes - Moggi
2	Axiomatising operational equivalence in the presence of side effects - Mason, Talcott - 1989