Comprehending Monads

Comprehending Monads (1992)

by Philip Wadler

Venue:	Mathematical Structures in Computer Science
Citations:	418 - 11 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Comprehending Monads	INFERENCE
AUTHOR NAME	Philip Wadler	SVM HeaderParse 0.1
AUTHOR AFFIL	University of Glasgow	SVM HeaderParse 0.2
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.	user correction - Legacy Corrections
YEAR	1992	user correction - Legacy Corrections
VENUE	Mathematical Structures in Computer Science	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	61--78	INFERENCE
VOLUME	2	INFERENCE
CITATIONS	36 found	ParsCit 1.0