Difference between revisions of "Monad"

From HaskellWiki
Jump to: navigation, search
Line 173: Line 173:
 
* [http://haskell.org/ghc/docs/latest/html/libraries/mtl/Control-Monad-Writer.html Writable state]
 
* [http://haskell.org/ghc/docs/latest/html/libraries/mtl/Control-Monad-Writer.html Writable state]
 
* [http://haskell.org/haskellwiki/New_monads/MonadSupply Unique supply]
 
* [http://haskell.org/haskellwiki/New_monads/MonadSupply Unique supply]
* [http://haskell.org/ghc/docs/latest/html/libraries/base/Control-Monad-ST.html ST]
+
* [http://haskell.org/ghc/docs/latest/html/libraries/base/Control-Monad-ST.html ST - memory-only effects]
* [http://haskell.org/ghc/docs/latest/html/libraries/mtl/Control-Monad-State.html State]
+
* [http://haskell.org/ghc/docs/latest/html/libraries/mtl/Control-Monad-State.html Global state]
* [http://haskell.org/haskellwiki/New_monads/MonadUndo Undoable state]
+
* [http://haskell.org/haskellwiki/New_monads/MonadUndo Undoable state effects]
 
* [http://haskell.org/ghc/docs/latest/html/libraries/base/Control-Monad-Instances.html Function application]
 
* [http://haskell.org/ghc/docs/latest/html/libraries/base/Control-Monad-Instances.html Function application]
* [http://haskell.org/ghc/docs/latest/html/libraries/mtl/Control-Monad-Error.html Error]
+
* [http://haskell.org/ghc/docs/latest/html/libraries/mtl/Control-Monad-Error.html Functions which may error]
 
* [http://haskell.org/ghc/docs/latest/html/libraries/stm/Control-Monad-STM.html Atomic memory transactions]
 
* [http://haskell.org/ghc/docs/latest/html/libraries/stm/Control-Monad-STM.html Atomic memory transactions]
 
* [http://haskell.org/ghc/docs/latest/html/libraries/mtl/Control-Monad-Cont.html Continuations]
 
* [http://haskell.org/ghc/docs/latest/html/libraries/mtl/Control-Monad-Cont.html Continuations]
* [http://haskell.org/ghc/docs/latest/html/libraries/base/System-IO.html#t%3AIO IO]
+
* [http://haskell.org/ghc/docs/latest/html/libraries/base/System-IO.html#t%3AIO IO - unrestricted side effects]
 
* [http://www.haskell.org/haskellwiki/Sudoku Non-deterministic evaluation]
 
* [http://www.haskell.org/haskellwiki/Sudoku Non-deterministic evaluation]
* [http://haskell.org/ghc/docs/latest/html/libraries/mtl/Control-Monad-List.html List monad]
+
* [http://haskell.org/ghc/docs/latest/html/libraries/mtl/Control-Monad-List.html List monad: computations with multiple choices]
 
* [http://www.math.chalmers.se/~koen/pubs/entry-jfp99-monad.html Concurrent threads]
 
* [http://www.math.chalmers.se/~koen/pubs/entry-jfp99-monad.html Concurrent threads]
* [http://logic.csci.unt.edu/tarau/research/PapersHTML/monadic.html Backtracking]
+
* [http://logic.csci.unt.edu/tarau/research/PapersHTML/monadic.html Backtracking computations]
* [http://www.cs.cornell.edu/people/fluet/research/rgn-monad/index.html Region allocation]
+
* [http://www.cs.cornell.edu/people/fluet/research/rgn-monad/index.html Region allocation effects]
 
* [http://okmij.org/ftp/Computation/monads.html#LogicT LogicT: backtracking monad transformer with fair operations and pruning]
 
* [http://okmij.org/ftp/Computation/monads.html#LogicT LogicT: backtracking monad transformer with fair operations and pruning]
 
* [http://tsukimi.agusa.i.is.nagoya-u.ac.jp/~sydney/PiMonad/ Pi calculus as a monad]
 
* [http://tsukimi.agusa.i.is.nagoya-u.ac.jp/~sydney/PiMonad/ Pi calculus as a monad]

Revision as of 20:40, 30 January 2010

Monad class (base)
import Control.Monad

Monads in Haskell are structures used to supplement pure computations with features like state, common environment or I/O. Even though Haskell is a purely-functional language, side effects can be conveniently simulated using monads.

Because they are very useful in practice but rather mind-twisting for the beginners, numerous tutorials that deal exclusively with monads were created (see monad tutorials).

Common monads

Most common applications of monads include:

  • Representing failure using Maybe monad
  • Nondeterminism through backtracking using List monad
  • State using State monad
  • Read-only environment using Reader monad
  • I/O using IO monad

Monad class

Monads can be viewed as a standard programming interface to various data or control structures, which is captured by the Monad class. All common monads are members of it:

class Monad m where
  (>>=) :: m a -> (a -> m b) -> m b
  (>>) :: m a -> m b -> m b
  return :: a -> m a
  fail :: String -> m a

In addition to implementing the class functions, all instances of Monad should obey the following equations:

return a >>= k  =  k a
m >>= return  =  m
m >>= (\x -> k x >>= h)  =  (m >>= k) >>= h

See this intuitive explanation of why they should obey the Monad laws.

Any Monad can be made a Functor by defining

fmap ab ma = ma >>= (return . ab)

However, the Functor class is not a superclass of the Monad class. See Functor hierarchy proposal.

Special notation

In order to improve the look of code that uses monads Haskell provides a special syntactic sugar called do-notation. For example, following expression:

thing1 >>= (\x -> func1 x >>= (\y -> thing2 >>= (\_ -> func2 y (\z -> return z))))

which can be written more clearly by breaking it into several lines and omitting parentheses:

thing1 >>= \x ->
func1 x >>= \y ->
thing2 >>= \_ ->
func2 y >>= \z ->
return z

can be also written using the do-notation as follows:

do
  x <- thing1
  y <- func1 x
  thing2
  z <- func2 y
  return z

Code written using the do-notation is transformed by the compiler to ordinary expressions that use Monad class functions.

When using the do-notation and a monad like State or IO programs look very much like programs written in an imperative language as each line contains a statement that can change the simulated global state of the program and optionally binds a (local) variable that can be used by the statements later in the code block.

It is possible to intermix the do-notation with regular notation.

More on the do-notation can be found in a section of Monads as computation and in other tutorials.

Commutative monads

Commutative monads are monads for which the order of actions makes no difference (they commute), that is when following code:

do
  a <- f x
  b <- g y
  m a b

is the same as:

do
  b <- g y
  a <- f x
  m a b

Examples of commutative include:

  • Reader monad
  • Maybe monad

Monad tutorials

Monads are known for being deeply confusing to lots of people, so there are plenty of tutorials specifically related to monads. Each takes a different approach to Monads, and hopefully everyone will find something useful.

See Monad tutorials.

Monad reference guides

An explanation of the basic Monad functions, with examples, can be found in the reference guide A tour of the Haskell Monad functions, by Henk-Jan van Tuyl.

Monad research

A collection of research papers about monads.

Monads in other languages

Implementations of monads in other languages.

Unfinished:

And possibly there exist:

  • Standard ML (via modules?)

Please add them if you know of other implementations.

Collection of links to monad implementations in various languages. on Lambda The Ultimate.

Interesting monads

A list of monads for various evaluation strategies and games:


There are many more interesting instance of the monad abstraction out there. Please add them as you come across each species.

Fun