Comprehending Monads Export

@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}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.5381}, keywords = {functional, theory}, pages = {61--78}, posted-at = {2005-02-02 22:12:59}, priority = {0}, publisher = {ACM}, title = {Comprehending Monads}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.5381}, year = {1990} }

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