Comprehending Monads

by: PL Wadler

(1990), pp. 61-78.

View FullText article

CiteSeer (at Penn State), CiteSeer (at MIT), CiteSeer (at Zurich), CiteSeer (at Singapore)

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

hellige, rgrig, JeffreyPalmer, Darius, rwtodd, jrw, creswick, cedricboidin, zednenem, bfraser, ben_moseley, scis0000001, msn, mstone, bunge, rgb, Benja, jsala, meiersi, jasonmc, glaubersp, ds, conal, cdiggins, SRG_at_UCD (group), pileWorks (group), cognominal, benchambers, kazuya, hayeah, mmarcus, donniejones18

Find related articles with these CiteULike tags

category, category_theory, category-theory, computation, cs-functional, fp, fp-theory, functional, functional_programming, functional-programming, funtional-programming, haskell, lambda-calculus, languages, list, mathematics, monad, monads, no-tag, printed, theory

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....

@inproceedings{citeulike:82538, 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....}, address = {New York, NY}, author = {Wadler, P. L. }, booktitle = {Proceedings of the 1990 ACM Conference on LISP and Functional Programming, Nice}, citeulike-article-id = {82538}, keywords = {cs-functional}, pages = {61--78}, posted-at = {2007-03-20 09:25:20}, priority = {2}, publisher = {ACM}, title = {Comprehending Monads}, url = {http://citeseer.ist.psu.edu/wadler92comprehending.html}, year = {1990} }

RIS record

TY - CONF ID - citeulike:82538 L3 - citeulike-article-id:82538 TI - Comprehending Monads T2 - Proceedings of the 1990 ACM Conference on LISP and Functional Programming, Nice SP - 61 EP - 78 AD - New York, NY PB - ACM N2 - 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.... KW - cs-functional AU - Wadler, PL PY - 1990/// UR - http://citeseer.ist.psu.edu/wadler92comprehending.html ER -

RIS BibTeX