Difference between revisions of "All About Monads"
(→List is also a monad) 

Line 86:  Line 86:  
<haskell>  <haskell>  
−  type Sheep  +  type Sheep = ... 
father :: Sheep > Maybe Sheep  father :: Sheep > Maybe Sheep  
−  father  +  father = ... 
mother :: Sheep > Maybe Sheep  mother :: Sheep > Maybe Sheep  
−  mother  +  mother = ... 
</haskell>  </haskell>  
Then, defining functions to find grandparents is a little more complicated, because we have to handle the possibility of not having a parent:  Then, defining functions to find grandparents is a little more complicated, because we have to handle the possibility of not having a parent:  
Line 98:  Line 98:  
<haskell>  <haskell>  
maternalGrandfather :: Sheep > Maybe Sheep  maternalGrandfather :: Sheep > Maybe Sheep  
−  maternalGrandfather s  +  maternalGrandfather s = case (mother s) of 
Nothing > Nothing  Nothing > Nothing  
Just m > father m  Just m > father m  
Line 108:  Line 108:  
<haskell>  <haskell>  
mothersPaternalGrandfather :: Sheep > Maybe Sheep  mothersPaternalGrandfather :: Sheep > Maybe Sheep  
−  mothersPaternalGrandfather s  +  mothersPaternalGrandfather s = case (mother s) of 
Nothing > Nothing  Nothing > Nothing  
Just m > case (father m) of  Just m > case (father m) of  
Line 121:  Line 121:  
 comb is a combinator for sequencing operations that return Maybe   comb is a combinator for sequencing operations that return Maybe  
comb :: Maybe a > (a > Maybe b) > Maybe b  comb :: Maybe a > (a > Maybe b) > Maybe b  
−  comb Nothing _  +  comb Nothing _ = Nothing 
−  comb (Just x) f  +  comb (Just x) f = f x 
 now we can use `comb` to build complicated sequences   now we can use `comb` to build complicated sequences  
mothersPaternalGrandfather :: Sheep > Maybe Sheep  mothersPaternalGrandfather :: Sheep > Maybe Sheep  
−  mothersPaternalGrandfather s  +  mothersPaternalGrandfather s = (Just s) `comb` mother `comb` father `comb` father 
</haskell>  </haskell>  
The combinator is a huge success! The code is much cleaner and easier to write, understand and modify. Notice also that the <code>comb</code> function is entirely polymorphic — it is not specialized for <code>Sheep</code> in any way. In fact, ''the combinator captures a general strategy for combining computations that may fail to return a value.'' Thus, we can apply the same combinator to other computations that may fail to return a value, such as database queries or dictionary lookups.  The combinator is a huge success! The code is much cleaner and easier to write, understand and modify. Notice also that the <code>comb</code> function is entirely polymorphic — it is not specialized for <code>Sheep</code> in any way. In fact, ''the combinator captures a general strategy for combining computations that may fail to return a value.'' Thus, we can apply the same combinator to other computations that may fail to return a value, such as database queries or dictionary lookups.  
Line 136:  Line 136:  
We have seen that the <code>Maybe</code> type constructor is a monad for building computations which may fail to return a value. You may be surprised to know that another common Haskell type constructor, <code>[]</code> (for building lists), is also a monad. The List monad allows us to build computations which can return 0, 1, or more values.  We have seen that the <code>Maybe</code> type constructor is a monad for building computations which may fail to return a value. You may be surprised to know that another common Haskell type constructor, <code>[]</code> (for building lists), is also a monad. The List monad allows us to build computations which can return 0, 1, or more values.  
−  The <code>return</code> function for lists simply creates a singleton list (<code>return x  +  The <code>return</code> function for lists simply creates a singleton list (<code>return x = [x]</code>). The binding operation for lists creates a new list containing the results of applying the function to all of the values in the original list (<code>l >>= f = concatMap f l</code>). 
One use of functions which return lists is to represent ''ambiguous'' computations — that is computations which may have 0, 1, or more allowed outcomes. In a computation composed from ambigous subcomputations, the ambiguity may compound, or it may eventually resolve into a single allowed outcome or no allowed outcome at all. During this process, the set of possible computational states is represented as a list. The List monad thus embodies a strategy for performing simultaneous computations along all allowed paths of an ambiguous computation.  One use of functions which return lists is to represent ''ambiguous'' computations — that is computations which may have 0, 1, or more allowed outcomes. In a computation composed from ambigous subcomputations, the ambiguity may compound, or it may eventually resolve into a single allowed outcome or no allowed outcome at all. During this process, the set of possible computational states is represented as a list. The List monad thus embodies a strategy for performing simultaneous computations along all allowed paths of an ambiguous computation.  
Line 175:  Line 175:  
<haskell>  <haskell>  
instance Monad Maybe where  instance Monad Maybe where  
−  Nothing >>  +  Nothing >>= f = Nothing 
−  (Just x) >>  +  (Just x) >>= f = f x 
−  return  +  return = Just 
</haskell>  </haskell>  
Once we have defined <code>Maybe</code> as an instance of the Monad class, we can use the standard monad operators to build the complex computations:  Once we have defined <code>Maybe</code> as an instance of the Monad class, we can use the standard monad operators to build the complex computations:  
Line 184:  Line 184:  
 we can use monadic operations to build complicated sequences   we can use monadic operations to build complicated sequences  
maternalGrandfather :: Sheep > Maybe Sheep  maternalGrandfather :: Sheep > Maybe Sheep  
−  maternalGrandfather s  +  maternalGrandfather s = (return s) >>= mother >>= father 
fathersMaternalGrandmother :: Sheep > Maybe Sheep  fathersMaternalGrandmother :: Sheep > Maybe Sheep  
−  fathersMaternalGrandmother s  +  fathersMaternalGrandmother s = (return s) >>= father >>= mother >>= mother 
</haskell>  </haskell>  
In Haskell, <code>Maybe</code> is defined as an instance of the <code>Monad</code> class in the standard prelude, so you don't need to do it yourself. The other monad we have seen so far, the list constructor, is also defined as an instance of the <code>Monad</code> class in the standard prelude.  In Haskell, <code>Maybe</code> is defined as an instance of the <code>Monad</code> class in the standard prelude, so you don't need to do it yourself. The other monad we have seen so far, the list constructor, is also defined as an instance of the <code>Monad</code> class in the standard prelude.  
Line 216:  Line 216:  
 we can also use donotation to build complicated sequences   we can also use donotation to build complicated sequences  
mothersPaternalGrandfather :: Sheep > Maybe Sheep  mothersPaternalGrandfather :: Sheep > Maybe Sheep  
−  mothersPaternalGrandfather s  +  mothersPaternalGrandfather s = do m < mother s 
gf < father m  gf < father m  
father gf  father gf  
Line 225:  Line 225:  
<haskell>  <haskell>  
−  mothersPaternalGrandfather s  +  mothersPaternalGrandfather s = do { m < mother s; gf < father m; father gf } 
</haskell>  </haskell>  
Notice that do notation resembles an imperative programming language, in which a computation is built up from an explicit sequence of simpler computations. In this respect, monads offer the possibility to create imperativestyle computations within a larger functional program. This theme will be expanded upon when we deal with sideeffects and the I/O monad later.  Notice that do notation resembles an imperative programming language, in which a computation is built up from an explicit sequence of simpler computations. In this respect, monads offer the possibility to create imperativestyle computations within a larger functional program. This theme will be expanded upon when we deal with sideeffects and the I/O monad later.  
Line 234:  Line 234:  
<haskell>  <haskell>  
−  expr1 >>  +  expr1 >>= \x > 
</haskell>  </haskell>  
and every expression without a variable assignment, <code>expr2</code> becomes  and every expression without a variable assignment, <code>expr2</code> becomes  
<haskell>  <haskell>  
−  expr2 >>  +  expr2 >>= \_ > 
</haskell>  </haskell>  
All do blocks must end with a monadic expression, and a let clause is allowed at the beginning of a do block (but let clauses in do blocks do not use the "in" keyword). The definition of <code>mothersPaternalGrandfather</code> above would be translated to:  All do blocks must end with a monadic expression, and a let clause is allowed at the beginning of a do block (but let clauses in do blocks do not use the "in" keyword). The definition of <code>mothersPaternalGrandfather</code> above would be translated to:  
<haskell>  <haskell>  
−  mothersPaternalGrandfather s  +  mothersPaternalGrandfather s = mother s >>= (\m > 
−  father m >>  +  father m >>= (\gf > 
father gf))  father gf))  
</haskell>  </haskell>  
Line 267:  Line 267:  
The concept of a monad comes from a branch of mathematics called category theory. While it is not necessary to know category theory to create and use monads, we do need to obey a small bit of mathematical formalism. To create a monad, it is not enough just to declare a Haskell instance of the <code>Monad</code> class with the correct type signatures. To be a proper monad, the <code>return</code> and <code>>>=</code> functions must work together according to three laws:  The concept of a monad comes from a branch of mathematics called category theory. While it is not necessary to know category theory to create and use monads, we do need to obey a small bit of mathematical formalism. To create a monad, it is not enough just to declare a Haskell instance of the <code>Monad</code> class with the correct type signatures. To be a proper monad, the <code>return</code> and <code>>>=</code> functions must work together according to three laws:  
−  # <code>(return x) >>  +  # <code>(return x) >>= f ==== f x</code> 
−  # <code>m >>  +  # <code>m >>= return ==== m</code> 
−  # <code>(m >>  +  # <code>(m >>= f) >>= g ==== m >>= (\x > f x >>= g)</code> 
The first law requires that <code>return</code> is a leftidentity with respect to <code>>>=</code>. The second law requires that <code>return</code> is a rightidentity with respect to <code>>>=</code>. The third law is a kind of associativity law for <code>>>=</code>. Obeying the three laws ensures that the semantics of the donotation using the monad will be consistent.  The first law requires that <code>return</code> is a leftidentity with respect to <code>>>=</code>. The second law requires that <code>return</code> is a rightidentity with respect to <code>>>=</code>. The third law is a kind of associativity law for <code>>>=</code>. Obeying the three laws ensures that the semantics of the donotation using the monad will be consistent.  
Line 282:  Line 282:  
<haskell>  <haskell>  
−  fail s  +  fail s = error s 
</haskell>  </haskell>  
You do not need to change this for your monad unless you want to provide different behavior for failure or to incorporate failure into the computational strategy of your monad. The <code>Maybe</code> monad, for instance, defines <code>fail</code> as:  You do not need to change this for your monad unless you want to provide different behavior for failure or to incorporate failure into the computational strategy of your monad. The <code>Maybe</code> monad, for instance, defines <code>fail</code> as:  
<haskell>  <haskell>  
−  fail _  +  fail _ = Nothing 
</haskell>  </haskell>  
so that <code>fail</code> returns an instance of the <code>Maybe</code> monad with meaningful behavior when it is bound with other functions in the <code>Maybe</code> monad.  so that <code>fail</code> returns an instance of the <code>Maybe</code> monad with meaningful behavior when it is bound with other functions in the <code>Maybe</code> monad.  
Line 295:  Line 295:  
<haskell>  <haskell>  
fn :: Int > Maybe [Int]  fn :: Int > Maybe [Int]  
−  fn idx  +  fn idx = do let l = [Just [1,2,3], Nothing, Just [], Just [7..20]] 
(x:xs) < l!!idx  a pattern match failure will call "fail"  (x:xs) < l!!idx  a pattern match failure will call "fail"  
return xs  return xs  
Line 305:  Line 305:  
<haskell>  <haskell>  
(>>) :: m a > m b > m b  (>>) :: m a > m b > m b  
−  m >> k  +  m >> k = m >>= (\_ > k) 
</haskell>  </haskell>  
=== No way out ===  === No way out ===  
Line 325:  Line 325:  
Beyond the three monad laws stated above, some monads obey additional laws. These monads have a special value <code>mzero</code> and an operator <code>mplus</code> that obey four additional laws:  Beyond the three monad laws stated above, some monads obey additional laws. These monads have a special value <code>mzero</code> and an operator <code>mplus</code> that obey four additional laws:  
−  # <code>mzero >>  +  # <code>mzero >>= f == mzero</code> 
−  # <code>m >>  +  # <code>m >>= (\x > mzero) == mzero</code> 
−  # <code>mzero `mplus` m  +  # <code>mzero `mplus` m == m</code> 
−  # <code>m `mplus` mzero  +  # <code>m `mplus` mzero == m</code> 
It is easy to remember the laws for <code>mzero</code> and <code>mplus</code> if you associate <code>mzero</code> with 0, <code>mplus</code> with +, and <code>>>=</code> with × in ordinary arithmetic.  It is easy to remember the laws for <code>mzero</code> and <code>mplus</code> if you associate <code>mzero</code> with 0, <code>mplus</code> with +, and <code>>>=</code> with × in ordinary arithmetic.  
Line 343:  Line 343:  
<haskell>  <haskell>  
instance MonadPlus Maybe where  instance MonadPlus Maybe where  
−  mzero  +  mzero = Nothing 
−  Nothing `mplus` x  +  Nothing `mplus` x = x 
−  x `mplus` _  +  x `mplus` _ = x 
</haskell>  </haskell>  
This identifies <code>Nothing</code> as the zero value and says that adding two <code>Maybe</code> values together gives the first value that is not <code>Nothing</code>. If both input values are <code>Nothing</code>, then the result of <code>mplus</code> is also <code>Nothing</code>.  This identifies <code>Nothing</code> as the zero value and says that adding two <code>Maybe</code> values together gives the first value that is not <code>Nothing</code>. If both input values are <code>Nothing</code>, then the result of <code>mplus</code> is also <code>Nothing</code>.  
Line 351:  Line 351:  
The List monad also has a zero and a plus. <code>mzero</code> is the empty list and <code>mplus</code> is the <code>++</code> operator.  The List monad also has a zero and a plus. <code>mzero</code> is the empty list and <code>mplus</code> is the <code>++</code> operator.  
−  The <code>mplus</code> operator is used to combine monadic values from separate computations into a single monadic value. Within the context of our sheepcloning example, we could use <code>Maybe</code>'s <code>mplus</code> to define a function, <code>parent s  +  The <code>mplus</code> operator is used to combine monadic values from separate computations into a single monadic value. Within the context of our sheepcloning example, we could use <code>Maybe</code>'s <code>mplus</code> to define a function, <code>parent s = (mother s) `mplus` (father s)</code>, which would return a parent if there is one, and <code>Nothing</code> is the sheep has no parents at all. For a sheep with both parents, the function would return one or the other, depending on the exact definition of <code>mplus</code> in the <code>Maybe</code> monad. 
=== Summary ===  === Summary ===  
Line 419:  Line 419:  
 Minimal complete definition:   Minimal complete definition:  
 (>>=), return   (>>=), return  
−  m >> k  +  m >> k = m >>= \_ > k 
−  fail s  +  fail s = error s 
</haskell>  </haskell>  
==== The sequencing functions ====  ==== The sequencing functions ====  
Line 428:  Line 428:  
<haskell>  <haskell>  
sequence :: Monad m ==> [m a] > m [a]  sequence :: Monad m ==> [m a] > m [a]  
−  sequence  +  sequence = foldr mcons (return []) 
−  where mcons p q  +  where mcons p q = p >>= \x > q >>= \y > return (x:y) 
</haskell>  </haskell>  
The <code>sequence_</code> function (notice the underscore) has the same behavior as <code>sequence</code> but does not return a list of results. It is useful when only the sideeffects of the monadic computations are important.  The <code>sequence_</code> function (notice the underscore) has the same behavior as <code>sequence</code> but does not return a list of results. It is useful when only the sideeffects of the monadic computations are important.  
Line 435:  Line 435:  
<haskell>  <haskell>  
sequence_ :: Monad m ==> [m a] > m ()  sequence_ :: Monad m ==> [m a] > m ()  
−  sequence_  +  sequence_ = foldr (>>) (return ()) 
</haskell>  </haskell>  
==== The mapping functions ====  ==== The mapping functions ====  
Line 443:  Line 443:  
<haskell>  <haskell>  
mapM :: Monad m ==> (a > m b) > [a] > m [b]  mapM :: Monad m ==> (a > m b) > [a] > m [b]  
−  mapM f as  +  mapM f as = sequence (map f as) 
</haskell>  </haskell>  
There is also a version with an underscore, <code>mapM_</code> which is defined using sequence_. <code>mapM_</code> operates the same as <code>mapM</code>, but it doesn't return the list of values. It is useful when only the sideeffects of the monadic computation are important.  There is also a version with an underscore, <code>mapM_</code> which is defined using sequence_. <code>mapM_</code> operates the same as <code>mapM</code>, but it doesn't return the list of values. It is useful when only the sideeffects of the monadic computation are important.  
Line 449:  Line 449:  
<haskell>  <haskell>  
mapM_ :: Monad m ==> (a > m b) > [a] > m ()  mapM_ :: Monad m ==> (a > m b) > [a] > m ()  
−  mapM_ f as  +  mapM_ f as = sequence_ (map f as) 
</haskell>  </haskell>  
As a simple example of the use the mapping functions, a <code>putString</code> function for the <code>IO</code> monad could be defined as:  As a simple example of the use the mapping functions, a <code>putString</code> function for the <code>IO</code> monad could be defined as:  
Line 455:  Line 455:  
<haskell>  <haskell>  
putString :: [Char] > IO ()  putString :: [Char] > IO ()  
−  putString s  +  putString s = mapM_ putChar s 
</haskell>  </haskell>  
<code>mapM</code> can be used within a do block in a manner similar to the way the <code>map</code> function is normally used on lists. This is a common pattern with monads — a version of a function for use within a monad (i.e., intended for binding) will have a signature similar to the nonmonadic version but the function outputs will be within the monad:  <code>mapM</code> can be used within a do block in a manner similar to the way the <code>map</code> function is normally used on lists. This is a common pattern with monads — a version of a function for use within a monad (i.e., intended for binding) will have a signature similar to the nonmonadic version but the function outputs will be within the monad:  
Line 470:  Line 470:  
<haskell>  <haskell>  
(=<<) :: Monad m ==> (a > m b) > m a > m b  (=<<) :: Monad m ==> (a > m b) > m a > m b  
−  f  +  f =<< x = x >>= f 
</haskell>  </haskell>  
=== In the Monad module ===  === In the Monad module ===  
Line 495:  Line 495:  
<haskell>  <haskell>  
foldM :: (Monad m) ==> (a > b > m a) > a > [b] > m a  foldM :: (Monad m) ==> (a > b > m a) > a > [b] > m a  
−  foldM f a []  +  foldM f a [] = return a 
−  foldM f a (x:xs)  +  foldM f a (x:xs) = f a x >>= \y > foldM f y xs 
</haskell>  </haskell>  
but it is easier to understand the operation of <code>foldM</code> if you consider its effect in terms of a do block:  but it is easier to understand the operation of <code>foldM</code> if you consider its effect in terms of a do block:  
Line 502:  Line 502:  
<haskell>  <haskell>  
 this is not valid Haskell code, it is just for illustration   this is not valid Haskell code, it is just for illustration  
−  foldM f a1 [x1,x2,...,xn]  +  foldM f a1 [x1,x2,...,xn] = do a2 < f a1 x1 
a3 < f a2 x2  a3 < f a2 x2  
...  ...  
Line 516:  Line 516:  
 traceFamily is a generic function to find an ancestor   traceFamily is a generic function to find an ancestor  
traceFamily :: Sheep > [ (Sheep > Maybe Sheep) ] > Maybe Sheep  traceFamily :: Sheep > [ (Sheep > Maybe Sheep) ] > Maybe Sheep  
−  traceFamily s l  +  traceFamily s l = foldM getParent s l 
−  where getParent s f  +  where getParent s f = f s 
 we can define complex queries using traceFamily in an easy, clear way   we can define complex queries using traceFamily in an easy, clear way  
−  mothersPaternalGrandfather s  +  mothersPaternalGrandfather s = traceFamily s [mother, father, father] 
−  paternalGrandmother s  +  paternalGrandmother s = traceFamily s [father, mother] 
</haskell>  </haskell>  
The <code>traceFamily</code> function uses <code>foldM</code> to create a simple way to trace back in the family tree to any depth and in any pattern. In fact, it is probably clearer to write "<code>traceFamily s [father, mother]</code>" than it is to use the <code>paternalGrandmother</code> function!  The <code>traceFamily</code> function uses <code>foldM</code> to create a simple way to trace back in the family tree to any depth and in any pattern. In fact, it is probably clearer to write "<code>traceFamily s [father, mother]</code>" than it is to use the <code>paternalGrandmother</code> function!  
Line 531:  Line 531:  
<haskell>  <haskell>  
 a Dict is just a finite map from strings to strings   a Dict is just a finite map from strings to strings  
−  type Dict  +  type Dict = FiniteMap String String 
 this an auxilliary function used with foldl   this an auxilliary function used with foldl  
addEntry :: Dict > Entry > Dict  addEntry :: Dict > Entry > Dict  
−  addEntry d e  +  addEntry d e = addToFM d (key e) (value e) 
 this is an auxiliiary function used with foldM inside the IO monad   this is an auxiliiary function used with foldM inside the IO monad  
addDataFromFile :: Dict > Handle > IO Dict  addDataFromFile :: Dict > Handle > IO Dict  
−  addDataFromFile dict hdl  +  addDataFromFile dict hdl = do contents < hGetContents hdl 
entries < return (map read (lines contents))  entries < return (map read (lines contents))  
return (foldl (addEntry) dict entries)  return (foldl (addEntry) dict entries)  
Line 546:  Line 546:  
 command line and then prints it out as an association list   command line and then prints it out as an association list  
main :: IO ()  main :: IO ()  
−  main  +  main = do files < getArgs 
handles < mapM openForReading files  handles < mapM openForReading files  
dict < foldM addDataFromFile emptyFM handles  dict < foldM addDataFromFile emptyFM handles  
Line 555:  Line 555:  
<haskell>  <haskell>  
filterM :: Monad m ==> (a > m Bool) > [a] > m [a]  filterM :: Monad m ==> (a > m Bool) > [a] > m [a]  
−  filterM p []  +  filterM p [] = return [] 
−  filterM p (x:xs)  +  filterM p (x:xs) = do b < p x 
ys < filterM p xs  ys < filterM p xs  
return (if b then (x:ys) else ys)  return (if b then (x:ys) else ys)  
Line 573:  Line 573:  
 this program prints only the directories named on the command line   this program prints only the directories named on the command line  
main :: IO ()  main :: IO ()  
−  main  +  main = do names < getArgs 
dirs < filterM doesDirectoryExist names  dirs < filterM doesDirectoryExist names  
mapM_ putStrLn dirs  mapM_ putStrLn dirs  
Line 581:  Line 581:  
<haskell>  <haskell>  
zipWithM ::(Monad m) ==> (a > b > m c) > [a] > [b] > m [c]  zipWithM ::(Monad m) ==> (a > b > m c) > [a] > [b] > m [c]  
−  zipWithM f xs ys  +  zipWithM f xs ys = sequence (zipWith f xs ys) 
zipWithM_ ::(Monad m) ==> (a > b > m c) > [a] > [b] > m ()  zipWithM_ ::(Monad m) ==> (a > b > m c) > [a] > [b] > m ()  
−  zipWithM_ f xs ys  +  zipWithM_ f xs ys = sequence_ (zipWith f xs ys) 
</haskell>  </haskell>  
==== Conditional monadic computations ====  ==== Conditional monadic computations ====  
Line 592:  Line 592:  
<haskell>  <haskell>  
when :: (Monad m) ==> Bool > m () > m ()  when :: (Monad m) ==> Bool > m () > m ()  
−  when p s  +  when p s = if p then s else return () 
unless :: (Monad m) ==> Bool > m () > m ()  unless :: (Monad m) ==> Bool > m () > m ()  
−  unless p s  +  unless p s = when (not p) s 
</haskell>  </haskell>  
==== <code>ap</code> and the lifting functions ====  ==== <code>ap</code> and the lifting functions ====  
Line 605:  Line 605:  
<haskell>  <haskell>  
liftM :: (Monad m) ==> (a > b) > (m a > m b)  liftM :: (Monad m) ==> (a > b) > (m a > m b)  
−  liftM f  +  liftM f = \a > do { a' < a; return (f a') } 
</haskell>  </haskell>  
Lifting operators are also provided for functions with more arguments. <code>liftM2</code> lifts functions of two arguments:  Lifting operators are also provided for functions with more arguments. <code>liftM2</code> lifts functions of two arguments:  
Line 611:  Line 611:  
<haskell>  <haskell>  
liftM2 :: (Monad m) ==> (a > b > c) > (m a > m b > m c)  liftM2 :: (Monad m) ==> (a > b > c) > (m a > m b > m c)  
−  liftM2 f  +  liftM2 f = \a b > do { a' < a; b' < b; return (f a' b') } 
</haskell>  </haskell>  
The same pattern is applied to give the definitions to lift functions of more arguments. Functions up to <code>liftM5</code> are defined in the <code>Monad</code> module.  The same pattern is applied to give the definitions to lift functions of more arguments. Functions up to <code>liftM5</code> are defined in the <code>Monad</code> module.  
Line 619:  Line 619:  
<haskell>  <haskell>  
getName :: String > Maybe String  getName :: String > Maybe String  
−  getName name  +  getName name = do let db = [("John", "Smith, John"), ("Mike", "Caine, Michael")] 
tempName < lookup name db  tempName < lookup name db  
return (swapNames tempName)  return (swapNames tempName)  
Line 629:  Line 629:  
<haskell>  <haskell>  
getName :: String > Maybe String  getName :: String > Maybe String  
−  getName name  +  getName name = do let db = [("John", "Smith, John"), ("Mike", "Caine, Michael")] 
liftM swapNames (lookup name db)  liftM swapNames (lookup name db)  
</haskell>  </haskell>  
Line 647:  Line 647:  
 [0*1*3,0*1*5,0*2*3,0*2*5,1*1*3,1*1*5,1*2*3,1*2*5], or [0,0,0,0,3,5,6,10]   [0*1*3,0*1*5,0*2*3,0*2*5,1*1*3,1*1*5,1*2*3,1*2*5], or [0,0,0,0,3,5,6,10]  
allCombinations :: (a > a > a) > [[a]] > [a]  allCombinations :: (a > a > a) > [[a]] > [a]  
−  allCombinations fn []  +  allCombinations fn [] = [] 
−  allCombinations fn (l:ls)  +  allCombinations fn (l:ls) = foldl (liftM2 fn) l ls 
</haskell>  </haskell>  
There is a related function called <code>ap</code> that is sometimes more convenient to use than the lifting functions. <code>ap</code> is simply the function application operator (<code>$</code>) lifted into the monad:  There is a related function called <code>ap</code> that is sometimes more convenient to use than the lifting functions. <code>ap</code> is simply the function application operator (<code>$</code>) lifted into the monad:  
Line 654:  Line 654:  
<haskell>  <haskell>  
ap :: (Monad m) ==> m (a > b) > m a > m b  ap :: (Monad m) ==> m (a > b) > m a > m b  
−  ap  +  ap = liftM2 ($) 
</haskell>  </haskell>  
Note that <code>liftM2 f x y</code> is equivalent to <code>return f `ap` x `ap` y</code>, and so on for functions of more arguments. <code>ap</code> is useful when working with higherorder functions and monads.  Note that <code>liftM2 f x y</code> is equivalent to <code>return f `ap` x `ap` y</code>, and so on for functions of more arguments. <code>ap</code> is useful when working with higherorder functions and monads.  
Line 666:  Line 666:  
 compute a result.   compute a result.  
main :: IO ()  main :: IO ()  
−  main  +  main = do let fns = [("double",(2*)), ("halve",(`div`2)), 
("square",(\x>x*x)), ("negate", negate),  ("square",(\x>x*x)), ("negate", negate),  
("incr",(+1)), ("decr",(+(1)))  ("incr",(+1)), ("decr",(+(1)))  
]  ]  
args < getArgs  args < getArgs  
−  let val  +  let val = read (args!!0) 
−  cmds  +  cmds = map ((flip lookup) fns) (words (args!!1)) 
print $ foldl (flip ap) (Just val) cmds  print $ foldl (flip ap) (Just val) cmds  
</haskell>  </haskell>  
Line 681:  Line 681:  
<haskell>  <haskell>  
msum :: MonadPlus m ==> [m a] > m a  msum :: MonadPlus m ==> [m a] > m a  
−  msum xs  +  msum xs = foldr mplus mzero xs 
</haskell>  </haskell>  
In the List monad, <code>msum</code> is equivalent to <code>concat</code>. In the <code>Maybe</code> monad, <code>msum</code> returns the first non<code>Nothing</code> value from a list. Likewise, the behavior in other monads will depend on the exact nature of their <code>mzero</code> and <code>mplus</code> definitions.  In the List monad, <code>msum</code> is equivalent to <code>concat</code>. In the <code>Maybe</code> monad, <code>msum</code> returns the first non<code>Nothing</code> value from a list. Likewise, the behavior in other monads will depend on the exact nature of their <code>mzero</code> and <code>mplus</code> definitions.  
Line 690:  Line 690:  
<haskell>  <haskell>  
−  type Variable  +  type Variable = String 
−  type Value  +  type Value = String 
−  type EnvironmentStack  +  type EnvironmentStack = [[(Variable,Value)]] 
 lookupVar retrieves a variable's value from the environment stack   lookupVar retrieves a variable's value from the environment stack  
 It uses msum in the Maybe monad to return the first nonNothing value.   It uses msum in the Maybe monad to return the first nonNothing value.  
lookupVar :: Variable > EnvironmentStack > Maybe Value  lookupVar :: Variable > EnvironmentStack > Maybe Value  
−  lookupVar var stack  +  lookupVar var stack = msum $ map (lookup var) stack 
</haskell>  </haskell>  
instead of:  instead of:  
Line 703:  Line 703:  
<haskell>  <haskell>  
lookupVar :: Variable > EnvironmentStack > Maybe Value  lookupVar :: Variable > EnvironmentStack > Maybe Value  
−  lookupVar var []  +  lookupVar var [] = Nothing 
−  lookupVar var (e:es)  +  lookupVar var (e:es) = let val = lookup var e 
in maybe (lookupVar var es) Just val  in maybe (lookupVar var es) Just val  
</haskell>  </haskell>  
Line 711:  Line 711:  
<haskell>  <haskell>  
guard :: MonadPlus m ==> Bool > m ()  guard :: MonadPlus m ==> Bool > m ()  
−  guard p  +  guard p = if p then return () else mzero 
</haskell>  </haskell>  
−  The trick to understanding this function is to recall the law for monads with zero and plus that states <code>mzero >>  +  The trick to understanding this function is to recall the law for monads with zero and plus that states <code>mzero >>= f ==== mzero</code>. So, placing a <code>guard</code> function in a sequence of monadic operations will force any execution in which the guard is <code>False</code> to be <code>mzero</code>. This is similar to the way that guard predicates in a list comprehension cause values that fail the predicate to become <code>[]</code>. 
Here is an example demonstrating the use of the <code>guard</code> function in the <code>Maybe</code> monad.  Here is an example demonstrating the use of the <code>guard</code> function in the <code>Maybe</code> monad.  
Line 720:  Line 720:  
<haskell>  <haskell>  
−  data Record  +  data Record = Rec {name::String, age::Int} deriving Show 
−  type DB  +  type DB = [Record] 
 getYoungerThan returns all records for people younger than a specified age.   getYoungerThan returns all records for people younger than a specified age.  
Line 729:  Line 729:  
 guard becomes more useful.   guard becomes more useful.  
getYoungerThan :: Int > DB > [Record]  getYoungerThan :: Int > DB > [Record]  
−  getYoungerThan limit db  +  getYoungerThan limit db = mapMaybe (\r > do { guard (age r < limit); return r }) db 
</haskell>  </haskell>  
Line 794:  Line 794:  
* '''Computation type''': Simple function application  * '''Computation type''': Simple function application  
−  * '''Binding strategy''': The bound function is applied to the input value. <code>Identity x >>  +  * '''Binding strategy''': The bound function is applied to the input value. <code>Identity x >>= f ==== f x</code> 
* '''Useful for''': Monads can be derived from monad transformers applied to the Identity monad.  * '''Useful for''': Monads can be derived from monad transformers applied to the Identity monad.  
Line 809:  Line 809:  
<haskell>  <haskell>  
−  newtype Identity a  +  newtype Identity a = Identity { runIdentity :: a } 
instance Monad Identity where  instance Monad Identity where  
−  return a  +  return a = Identity a  i.e. return = id 
−  (Identity x) >>  +  (Identity x) >>= f = f x  i.e. x >>= f = f x 
</haskell>  </haskell>  
The <code>runIdentity</code> label is used in the type definition because it follows a style of monad definition that explicitly represents monad values as computations. In this style, a monadic computation is built up using the monadic operators and then the value of the computation is extracted using the <code>run******</code> function. Because the Identity monad does not do any computation, its definition is trivial. For a better example of this style of monad, see the [[statemonad.htmlState]] monad.  The <code>runIdentity</code> label is used in the type definition because it follows a style of monad definition that explicitly represents monad values as computations. In this style, a monadic computation is built up using the monadic operators and then the value of the computation is extracted using the <code>run******</code> function. Because the Identity monad does not do any computation, its definition is trivial. For a better example of this style of monad, see the [[statemonad.htmlState]] monad.  
Line 822:  Line 822:  
<haskell>  <haskell>  
 derive the State monad using the StateT monad transformer   derive the State monad using the StateT monad transformer  
−  type State s a  +  type State s a = StateT s Identity a 
</haskell>  </haskell>  
Line 857:  Line 857:  
<haskell>  <haskell>  
−  data Maybe a  +  data Maybe a = Nothing  Just a 
instance Monad Maybe where  instance Monad Maybe where  
−  return  +  return = Just 
−  fail  +  fail = Nothing 
−  Nothing >>  +  Nothing >>= f = Nothing 
−  (Just x) >>  +  (Just x) >>= f = f x 
instance MonadPlus Maybe where  instance MonadPlus Maybe where  
−  mzero  +  mzero = Nothing 
−  Nothing `mplus` x  +  Nothing `mplus` x = x 
−  x `mplus` _  +  x `mplus` _ = x 
</haskell>  </haskell>  
Line 876:  Line 876:  
<haskell>  <haskell>  
−  data MailPref  +  data MailPref = HTML  Plain 
−  data MailSystem  +  data MailSystem = ... 
getMailPrefs :: MailSystem > String > Maybe MailPref  getMailPrefs :: MailSystem > String > Maybe MailPref  
getMailPrefs sys name ==  getMailPrefs sys name ==  
−  do let nameDB  +  do let nameDB = fullNameDB sys 
−  nickDB  +  nickDB = nickNameDB sys 
−  prefDB  +  prefDB = prefsDB sys 
addr < (lookup name nameDB) `mplus` (lookup name nickDB)  addr < (lookup name nameDB) `mplus` (lookup name nickDB)  
lookup addr prefDB  lookup addr prefDB  
Line 932:  Line 932:  
<haskell>  <haskell>  
instance MonadError (Either e) where  instance MonadError (Either e) where  
−  throwError  +  throwError = Left 
−  (Left e) `catchError` handler  +  (Left e) `catchError` handler = handler e 
−  a `catchError` _  +  a `catchError` _ = a 
</haskell>  </haskell>  
Line 943:  Line 943:  
<haskell>  <haskell>  
 This is the type of our parse error representation.   This is the type of our parse error representation.  
−  data ParseError  +  data ParseError = Err {location::Int, reason::String} 
 We make it an instance of the Error class   We make it an instance of the Error class  
instance Error ParseError where  instance Error ParseError where  
−  noMsg  +  noMsg = Err 0 "Parse Error" 
−  strMsg s  +  strMsg s = Err 0 s 
 For our monad type constructor, we use Either ParseError   For our monad type constructor, we use Either ParseError  
 which represents failure using Left ParseError or a   which represents failure using Left ParseError or a  
 successful result of type a using Right a.   successful result of type a using Right a.  
−  type ParseMonad  +  type ParseMonad = Either ParseError 
 parseHexDigit attempts to convert a single hex digit into   parseHexDigit attempts to convert a single hex digit into  
Line 959:  Line 959:  
 invalid character   invalid character  
parseHexDigit :: Char > Int > ParseMonad Integer  parseHexDigit :: Char > Int > ParseMonad Integer  
−  parseHexDigit c idx  +  parseHexDigit c idx = if isHexDigit c then 
return (toInteger (digitToInt c))  return (toInteger (digitToInt c))  
else  else  
Line 968:  Line 968:  
 will cause an exceptional return from parseHex.   will cause an exceptional return from parseHex.  
parseHex :: String > ParseMonad Integer  parseHex :: String > ParseMonad Integer  
−  parseHex s  +  parseHex s = parseHex' s 0 1 
−  where parseHex' [] val _  +  where parseHex' [] val _ = return val 
−  parseHex' (c:cs) val idx  +  parseHex' (c:cs) val idx = do d < parseHexDigit c idx 
parseHex' cs ((val * 16) + d) (idx + 1)  parseHex' cs ((val * 16) + d) (idx + 1)  
 toString converts an Integer into a String in the ParseMonad monad   toString converts an Integer into a String in the ParseMonad monad  
toString :: Integer > ParseMonad String  toString :: Integer > ParseMonad String  
−  toString n  +  toString n = return $ show n 
 convert takes a String containing a hexadecimal representation of   convert takes a String containing a hexadecimal representation of  
Line 982:  Line 982:  
 descriptive error message as the output String.   descriptive error message as the output String.  
convert :: String > String  convert :: String > String  
−  convert s  +  convert s = let (Right str) = do {n < parseHex s; toString n} `catchError` printError 
in str  in str  
−  where printError e  +  where printError e = return $ "At index " ++ (show (location e)) ++ ":" ++ (reason e) 
</haskell>  </haskell>  
Line 1,009:  Line 1,009:  
<haskell>  <haskell>  
instance Monad [] where  instance Monad [] where  
−  m >>  +  m >>= f = concatMap f m 
−  return x  +  return x = [x] 
−  fail s  +  fail s = [] 
instance MonadPlus [] where  instance MonadPlus [] where  
−  mzero  +  mzero = [] 
−  mplus  +  mplus = (++) 
</haskell>  </haskell>  
Line 1,024:  Line 1,024:  
<haskell>  <haskell>  
 we can parse three different types of terms   we can parse three different types of terms  
−  data Parsed  +  data Parsed = Digit Integer  Hex Integer  Word String deriving Show 
 attempts to add a character to the parsed representation of a hex digit   attempts to add a character to the parsed representation of a hex digit  
parseHexDigit :: Parsed > Char > [Parsed]  parseHexDigit :: Parsed > Char > [Parsed]  
−  parseHexDigit (Hex n) c  +  parseHexDigit (Hex n) c = if isHexDigit c then 
return (Hex ((n*16) + (toInteger (digitToInt c))))  return (Hex ((n*16) + (toInteger (digitToInt c))))  
else  else  
mzero  mzero  
−  parseHexDigit _ _  +  parseHexDigit _ _ = mzero 
 attempts to add a character to the parsed representation of a decimal digit   attempts to add a character to the parsed representation of a decimal digit  
parseDigit :: Parsed > Char > [Parsed]  parseDigit :: Parsed > Char > [Parsed]  
−  parseDigit (Digit n) c  +  parseDigit (Digit n) c = if isDigit c then 
return (Digit ((n*10) + (toInteger (digitToInt c))))  return (Digit ((n*10) + (toInteger (digitToInt c))))  
else  else  
mzero  mzero  
−  parseDigit _ _  +  parseDigit _ _ = mzero 
 attempts to add a character to the parsed representation of a word   attempts to add a character to the parsed representation of a word  
parseWord :: Parsed > Char > [Parsed]  parseWord :: Parsed > Char > [Parsed]  
−  parseWord (Word s) c  +  parseWord (Word s) c = if isAlpha c then 
return (Word (s ++ [c]))  return (Word (s ++ [c]))  
else  else  
mzero  mzero  
−  parseWord _ _  +  parseWord _ _ = mzero 
 tries to parse the digit as a hex value, a decimal value and a word   tries to parse the digit as a hex value, a decimal value and a word  
 the result is a list of possible parses   the result is a list of possible parses  
parse :: Parsed > Char > [Parsed]  parse :: Parsed > Char > [Parsed]  
−  parse p c  +  parse p c = (parseHexDigit p c) `mplus` (parseDigit p c) `mplus` (parseWord p c) 
 parse an entire String and return a list of the possible parsed values   parse an entire String and return a list of the possible parsed values  
parseArg :: String > [Parsed]  parseArg :: String > [Parsed]  
−  parseArg s  +  parseArg s = do init < (return (Hex 0)) `mplus` (return (Digit 0)) `mplus` (return (Word "")) 
foldM parse init s  foldM parse init s  
</haskell>  </haskell>  
Line 1,093:  Line 1,093:  
<haskell>  <haskell>  
instance Monad IO where  instance Monad IO where  
−  return a  +  return a = ...  function from a > IO a 
−  m >>  +  m >>= k = ...  executes the I/O action m and binds the value to k's input 
−  fail s  +  fail s = ioError (userError s) 
−  data IOError  +  data IOError = ... 
ioError :: IOError > IO a  ioError :: IOError > IO a  
−  ioError  +  ioError = ... 
userError :: String > IOError  userError :: String > IOError  
−  userError  +  userError = ... 
catch :: IO a > (IOError > IO a) > IO a  catch :: IO a > (IOError > IO a) > IO a  
−  catch  +  catch = ... 
try :: IO a > IO (Either IOError a)  try :: IO a > IO (Either IOError a)  
−  try f  +  try f = catch (do r < f 
return (Right r))  return (Right r))  
(return . Left)  (return . Left)  
Line 1,120:  Line 1,120:  
instance MonadError IO where  instance MonadError IO where  
−  throwError  +  throwError = ioError 
−  catchError  +  catchError = catch 
</haskell>  </haskell>  
The <code>IO</code> module exports a convenience function called <code>try</code> that executes an I/O action and returns <code>Right result</code> if the action succeeded or <code>Left IOError</code> if an I/O error was caught.  The <code>IO</code> module exports a convenience function called <code>try</code> that executes an I/O action and returns <code>Right result</code> if the action succeeded or <code>Left IOError</code> if an I/O error was caught.  
Line 1,138:  Line 1,138:  
 translate char in set1 to corresponding char in set2   translate char in set1 to corresponding char in set2  
translate :: String > String > Char > Char  translate :: String > String > Char > Char  
−  translate [] _ c  +  translate [] _ c = c 
−  translate (x:xs) [] c  +  translate (x:xs) [] c = if x == c then ' ' else translate xs [] c 
−  translate (x:xs) [y] c  +  translate (x:xs) [y] c = if x == c then y else translate xs [y] c 
−  translate (x:xs) (y:ys) c  +  translate (x:xs) (y:ys) c = if x == c then y else translate xs ys c 
 translate an entire string   translate an entire string  
translateString :: String > String > String > String  translateString :: String > String > String > String  
−  translateString set1 set2 str  +  translateString set1 set2 str = map (translate set1 set2) str 
usage :: IOError > IO ()  usage :: IOError > IO ()  
−  usage e  +  usage e = do putStrLn "Usage: ex14 set1 set2" 
putStrLn "Translates characters in set1 on stdin to the corresponding"  putStrLn "Translates characters in set1 on stdin to the corresponding"  
putStrLn "characters from set2 and writes the translation to stdout."  putStrLn "characters from set2 and writes the translation to stdout."  
Line 1,154:  Line 1,154:  
 translates stdin to stdout based on commandline arguments   translates stdin to stdout based on commandline arguments  
main :: IO ()  main :: IO ()  
−  main  +  main = (do [set1,set2] < getArgs 
contents < hGetContents stdin  contents < hGetContents stdin  
putStr $ translateString set1 set2 contents)  putStr $ translateString set1 set2 contents)  
Line 1,179:  Line 1,179:  
<haskell>  <haskell>  
−  data MyType  +  data MyType = MT Int Bool Char Int deriving Show 
makeRandomValue :: StdGen > (MyType, StdGen)  makeRandomValue :: StdGen > (MyType, StdGen)  
−  makeRandomValue g  +  makeRandomValue g = let (n,g1) = randomR (1,100) g 
−  (b,g2)  +  (b,g2) = random g1 
−  (c,g3)  +  (c,g3) = randomR ('a','z') g2 
−  (m,g4)  +  (m,g4) = randomR (n,n) g3 
in (MT n b c m, g4)  in (MT n b c m, g4)  
</haskell>  </haskell>  
Line 1,195:  Line 1,195:  
<haskell>  <haskell>  
−  newtype State s a  +  newtype State s a = State { runState :: (s > (a,s)) } 
instance Monad (State s) where  instance Monad (State s) where  
−  return a  +  return a = State $ \s > (a,s) 
−  (State x) >>  +  (State x) >>= f = State $ \s > let (v,s') = x s in runState (f v) s' 
</haskell>  </haskell>  
Values in the State monad are represented as transition functions from an initial state to a (value,newState) pair and a new type definition is provided to describe this construct: <code>State s a</code> is the type of a value of type <code>a</code> inside the State monad with state of type <code>s</code>.  Values in the State monad are represented as transition functions from an initial state to a (value,newState) pair and a new type definition is provided to describe this construct: <code>State s a</code> is the type of a value of type <code>a</code> inside the State monad with state of type <code>s</code>.  
Line 1,211:  Line 1,211:  
instance MonadState (State s) s where  instance MonadState (State s) s where  
−  get  +  get = State $ \s > (s,s) 
−  put s  +  put s = State $ \_ > ((),s) 
</haskell>  </haskell>  
The <code>MonadState</code> class provides a standard but very simple interface for State monads. The <code>get</code> function retrieves the state by copying it as the value. The <code>put</code> function sets the state of the monad and does not yield a value.  The <code>MonadState</code> class provides a standard but very simple interface for State monads. The <code>get</code> function retrieves the state by copying it as the value. The <code>put</code> function sets the state of the monad and does not yield a value.  
Line 1,224:  Line 1,224:  
<haskell>  <haskell>  
−  data MyType  +  data MyType = MT Int Bool Char Int deriving Show 
{ Using the State monad, we can define a function that returns  { Using the State monad, we can define a function that returns  
Line 1,231:  Line 1,231:  
}  }  
getAny :: (Random a) ==> State StdGen a  getAny :: (Random a) ==> State StdGen a  
−  getAny  +  getAny = do g < get 
(x,g') < return $ random g  (x,g') < return $ random g  
put g'  put g'  
Line 1,238:  Line 1,238:  
 similar to getAny, but it bounds the random value returned   similar to getAny, but it bounds the random value returned  
getOne :: (Random a) ==> (a,a) > State StdGen a  getOne :: (Random a) ==> (a,a) > State StdGen a  
−  getOne bounds  +  getOne bounds = do g < get 
(x,g') < return $ randomR bounds g  (x,g') < return $ randomR bounds g  
put g'  put g'  
Line 1,248:  Line 1,248:  
}  }  
makeRandomValueST :: StdGen > (MyType, StdGen)  makeRandomValueST :: StdGen > (MyType, StdGen)  
−  makeRandomValueST  +  makeRandomValueST = runState (do n < getOne (1,100) 
b < getAny  b < getAny  
c < getOne ('a','z')  c < getOne ('a','z')  
Line 1,280:  Line 1,280:  
<haskell>  <haskell>  
−  newtype Reader e a  +  newtype Reader e a = Reader { runReader :: (e > a) } 
instance Monad (Reader e) where  instance Monad (Reader e) where  
−  return a  +  return a = Reader $ \e > a 
−  (Reader r) >>  +  (Reader r) >>= f = Reader $ \e > runReader (f (r e)) e 
</haskell>  </haskell>  
Values in the Reader monad are functions from an environment to a value. To extract the final value from a computation in the Reader monad, you simply apply <code>(runReader reader)</code> to an environment value.  Values in the Reader monad are functions from an environment to a value. To extract the final value from a computation in the Reader monad, you simply apply <code>(runReader reader)</code> to an environment value.  
Line 1,296:  Line 1,296:  
instance MonadReader e (Reader e) where  instance MonadReader e (Reader e) where  
−  ask  +  ask = Reader id 
−  local f c  +  local f c = Reader $ \e > runReader c (f e) 
asks :: (MonadReader e m) ==> (e > a) > m a  asks :: (MonadReader e m) ==> (e > a) > m a  
−  asks sel  +  asks sel = ask >>= return . sel 
</haskell>  </haskell>  
The <code>MonadReader</code> class provides a number of convenience functions that are very useful when working with a Reader monad. The <code>ask</code> function retrieves the environment and the <code>local</code> function executes a computation in a modified environment. The <code>asks</code> function is a convenience function that retrieves a function of the current environment, and is typically used with a selector or lookup function.  The <code>MonadReader</code> class provides a number of convenience functions that are very useful when working with a Reader monad. The <code>ask</code> function retrieves the environment and the <code>local</code> function executes a computation in a modified environment. The <code>asks</code> function is a convenience function that retrieves a function of the current environment, and is typically used with a selector or lookup function.  
Line 1,312:  Line 1,312:  
 This the abstract syntax representation of a template   This the abstract syntax representation of a template  
 Text Variable Quote Include Compound   Text Variable Quote Include Compound  
−  data Template  +  data Template = T String  V Template  Q Template  I Template [Definition]  C [Template] 
−  data Definition  +  data Definition = D Template Template 
 Our environment consists of an association list of named templates and   Our environment consists of an association list of named templates and  
 an association list of named variable values.   an association list of named variable values.  
−  data Environment  +  data Environment = Env {templates::[(String,Template)], 
variables::[(String,String)]}  variables::[(String,String)]}  
 lookup a variable from the environment   lookup a variable from the environment  
lookupVar :: String > Environment > Maybe String  lookupVar :: String > Environment > Maybe String  
−  lookupVar name env  +  lookupVar name env = lookup name (variables env) 
 lookup a template from the environment   lookup a template from the environment  
lookupTemplate :: String > Environment > Maybe Template  lookupTemplate :: String > Environment > Maybe Template  
−  lookupTemplate name env  +  lookupTemplate name env = lookup name (templates env) 
 add a list of resolved definitions to the environment   add a list of resolved definitions to the environment  
addDefs :: [(String,String)] > Environment > Environment  addDefs :: [(String,String)] > Environment > Environment  
−  addDefs defs env  +  addDefs defs env = env {variables = defs ++ (variables env)} 
 resolve a Definition and produce a (name,value) pair   resolve a Definition and produce a (name,value) pair  
resolveDef :: Definition > Reader Environment (String,String)  resolveDef :: Definition > Reader Environment (String,String)  
−  resolveDef (D t d)  +  resolveDef (D t d) = do name < resolve t 
value < resolve d  value < resolve d  
return (name,value)  return (name,value)  
Line 1,340:  Line 1,340:  
 resolve a template into a string   resolve a template into a string  
resolve :: Template > Reader Environment (String)  resolve :: Template > Reader Environment (String)  
−  resolve (T s)  +  resolve (T s) = return s 
−  resolve (V t)  +  resolve (V t) = do varName < resolve t 
varValue < asks (lookupVar varName)  varValue < asks (lookupVar varName)  
return $ maybe "" id varValue  return $ maybe "" id varValue  
−  resolve (Q t)  +  resolve (Q t) = do tmplName < resolve t 
body < asks (lookupTemplate tmplName)  body < asks (lookupTemplate tmplName)  
return $ maybe "" show body  return $ maybe "" show body  
−  resolve (I t ds)  +  resolve (I t ds) = do tmplName < resolve t 
body < asks (lookupTemplate tmplName)  body < asks (lookupTemplate tmplName)  
case body of  case body of  
Line 1,353:  Line 1,353:  
local (addDefs defs) (resolve t')  local (addDefs defs) (resolve t')  
Nothing > return ""  Nothing > return ""  
−  resolve (C ts)  +  resolve (C ts) = (liftM concat) (mapM resolve ts) 
</haskell>  </haskell>  
To use the Reader monad to resolve a template <code>t</code> into a <code>String</code>, you simply need to do <code>runReader (resolve t) env</code>.  To use the Reader monad to resolve a template <code>t</code> into a <code>String</code>, you simply need to do <code>runReader (resolve t) env</code>.  
Line 1,394:  Line 1,394:  
<haskell>  <haskell>  
−  newtype Writer w a  +  newtype Writer w a = Writer { runWriter :: (a,w) } 
instance (Monoid w) ==> Monad (Writer w) where  instance (Monoid w) ==> Monad (Writer w) where  
−  return a  +  return a = Writer (a,mempty) 
−  (Writer (a,w)) >>  +  (Writer (a,w)) >>= f = let (a',w') = runWriter $ f a in Writer (a',w `mappend` w') 
</haskell>  </haskell>  
The Writer monad maintains a (value,log) pair, where the log type must be a monoid. The <code>return</code> function simply returns the value along with an empty log. Binding executes the bound function using the current value as input, and appends any log output to the existing log.  The Writer monad maintains a (value,log) pair, where the log type must be a monoid. The <code>return</code> function simply returns the value along with an empty log. Binding executes the bound function using the current value as input, and appends any log output to the existing log.  
Line 1,409:  Line 1,409:  
instance (Monoid w) ==> MonadWriter w (Writer w) where  instance (Monoid w) ==> MonadWriter w (Writer w) where  
−  pass (Writer ((a,f),w))  +  pass (Writer ((a,f),w)) = Writer (a,f w) 
−  listen (Writer (a,w))  +  listen (Writer (a,w)) = Writer ((a,w),w) 
−  tell s  +  tell s = Writer ((),s) 
listens :: (MonadWriter w m) ==> (w > b) > m a > m (a,b)  listens :: (MonadWriter w m) ==> (w > b) > m a > m (a,b)  
−  listens f m  +  listens f m = do (a,w) < listen m; return (a,f w) 
censor :: (MonadWriter w m) ==> (w > w) > m a > m a  censor :: (MonadWriter w m) ==> (w > w) > m a > m a  
−  censor f m  +  censor f m = pass $ do a < m; return (a,f) 
</haskell>  </haskell>  
The <code>MonadWriter</code> class provides a number of convenience functions for working with Writer monads. The simplest and most useful is <code>tell</code>, which adds one or more entries to the log. The <code>listen</code> function turns a Writer that returns a value <code>a</code> and produces output <code>w</code> into a Writer that produces a value <code>(a,w)</code> and still produces output <code>w</code>. This allows the computation to "listen" to the log output generated by a Writer.  The <code>MonadWriter</code> class provides a number of convenience functions for working with Writer monads. The simplest and most useful is <code>tell</code>, which adds one or more entries to the log. The <code>listen</code> function turns a Writer that returns a value <code>a</code> and produces output <code>w</code> into a Writer that produces a value <code>(a,w)</code> and still produces output <code>w</code>. This allows the computation to "listen" to the log output generated by a Writer.  
Line 1,432:  Line 1,432:  
<haskell>  <haskell>  
 this is the format of our log entries   this is the format of our log entries  
−  data Entry  +  data Entry = Log {count::Int, msg::String} deriving Eq 
 add a message to the log   add a message to the log  
logMsg :: String > Writer [Entry] ()  logMsg :: String > Writer [Entry] ()  
−  logMsg s  +  logMsg s = tell [Log 1 s] 
 this handles one packet   this handles one packet  
filterOne :: [Rule] > Packet > Writer [Entry] (Maybe Packet)  filterOne :: [Rule] > Packet > Writer [Entry] (Maybe Packet)  
−  filterOne rules packet  +  filterOne rules packet = do 
rule < return (match rules packet)  rule < return (match rules packet)  
case rule of  case rule of  
Line 1,461:  Line 1,461:  
 the first message is logged and the second is returned as the result.   the first message is logged and the second is returned as the result.  
mergeEntries :: [Entry] > [Entry] > Writer [Entry] [Entry]  mergeEntries :: [Entry] > [Entry] > Writer [Entry] [Entry]  
−  mergeEntries [] x  +  mergeEntries [] x = return x 
−  mergeEntries x []  +  mergeEntries x [] = return x 
−  mergeEntries [e1] [e2]  +  mergeEntries [e1] [e2] = let (Log n msg) = e1 
−  (Log n' msg')  +  (Log n' msg') = e2 
−  in if msg  +  in if msg == msg' then 
return [(Log (n+n') msg)]  return [(Log (n+n') msg)]  
else  else  
Line 1,478:  Line 1,478:  
 log entries (using 'initial' as the initial log value).   log entries (using 'initial' as the initial log value).  
groupSame :: (Monoid a) ==> a > (a > a > Writer a a) > [b] > (b > Writer a c) > Writer a [c]  groupSame :: (Monoid a) ==> a > (a > a > Writer a a) > [b] > (b > Writer a c) > Writer a [c]  
−  groupSame initial merge [] _  +  groupSame initial merge [] _ = do tell initial 
return []  return []  
−  groupSame initial merge (x:xs) fn  +  groupSame initial merge (x:xs) fn = do (result,output) < return (runWriter (fn x)) 
new < merge initial output  new < merge initial output  
rest < groupSame new merge xs fn  rest < groupSame new merge xs fn  
Line 1,488:  Line 1,488:  
 the activity in which consecutive messages are merged   the activity in which consecutive messages are merged  
filterAll :: [Rule] > [Packet] > Writer [Entry] [Packet]  filterAll :: [Rule] > [Packet] > Writer [Entry] [Packet]  
−  filterAll rules packets  +  filterAll rules packets = do tell [Log 1 "STARTING PACKET FILTER"] 
out < groupSame [] mergeEntries packets (filterOne rules)  out < groupSame [] mergeEntries packets (filterOne rules)  
tell [Log 1 "STOPPING PACKET FILTER"]  tell [Log 1 "STOPPING PACKET FILTER"]  
Line 1,519:  Line 1,519:  
<haskell>  <haskell>  
−  newtype Cont r a  +  newtype Cont r a = Cont { runCont :: ((a > r) > r) }  r is the final result type of the whole computation 
instance Monad (Cont r) where  instance Monad (Cont r) where  
−  return a  +  return a = Cont $ \k > k a  i.e. return a = \k > k a 
−  (Cont c) >>  +  (Cont c) >>= f = Cont $ \k > c (\a > runCont (f a) k)  i.e. c >>= f = \k > c (\a > f a k) 
</haskell>  </haskell>  
The Continuation monad represents computations in continuationpassing style. <code>Cont r a</code> is a CPS computation that produces an intermediate result of type <code>a</code> within a CPS computation whose final result type is <code>r</code>.  The Continuation monad represents computations in continuationpassing style. <code>Cont r a</code> is a CPS computation that produces an intermediate result of type <code>a</code> within a CPS computation whose final result type is <code>r</code>.  
Line 1,534:  Line 1,534:  
instance MonadCont (Cont r) where  instance MonadCont (Cont r) where  
−  callCC f  +  callCC f = Cont $ \k > runCont (f (\a > Cont $ \_ > k a)) k 
</haskell>  </haskell>  
The <code>MonadCont</code> class provides the <code>callCC</code> function, which provides an escape continuation mechanism for use with Continuation monads. Escape continuations allow you to abort the current computation and return a value immediately. They achieve a similar effect to <code>throwError</code> and catchError within an <code>Error</code> monad.  The <code>MonadCont</code> class provides the <code>callCC</code> function, which provides an escape continuation mechanism for use with Continuation monads. Escape continuations allow you to abort the current computation and return a value immediately. They achieve a similar effect to <code>throwError</code> and catchError within an <code>Error</code> monad.  
Line 1,553:  Line 1,553:  
Input (n) Output List Shown  Input (n) Output List Shown  
−  +  ========= ====== =========  
09 n none  09 n none  
10199 number of digits in (n/2) digits of (n/2)  10199 number of digits in (n/2) digits of (n/2)  
Line 1,561:  Line 1,561:  
}  }  
fun :: Int > String  fun :: Int > String  
−  fun n  +  fun n = (`runCont` id) $ do 
str < callCC $ \exit1 > do  define "exit1"  str < callCC $ \exit1 > do  define "exit1"  
when (n < 10) (exit1 (show n))  when (n < 10) (exit1 (show n))  
−  let ns  +  let ns = map digitToInt (show (n `div` 2)) 
n' < callCC $ \exit2 > do  define "exit2"  n' < callCC $ \exit2 > do  define "exit2"  
when ((length ns) < 3) (exit2 (length ns))  when ((length ns) < 3) (exit2 (length ns))  
when ((length ns) < 5) (exit2 n)  when ((length ns) < 5) (exit2 n)  
−  when ((length ns) < 7) $ do let ns'  +  when ((length ns) < 7) $ do let ns' = map intToDigit (reverse ns) 
exit1 (dropWhile (=='0') ns') escape 2 levels  exit1 (dropWhile (=='0') ns') escape 2 levels  
return $ sum ns  return $ sum ns  
−  return $ "(ns  +  return $ "(ns = " ++ (show ns) ++ ") " ++ (show n') 
return $ "Answer: " ++ str  return $ "Answer: " ++ str  
</haskell>  </haskell>  
Line 1,601:  Line 1,601:  
<haskell>  <haskell>  
fun :: IO String  fun :: IO String  
−  fun  +  fun = do n < (readLn::IO Int)  this is an IO monad block 
return $ (`runCont` id) $ do  this is a Cont monad block  return $ (`runCont` id) $ do  this is a Cont monad block  
str < callCC $ \exit1 > do  str < callCC $ \exit1 > do  
when (n < 10) (exit1 (show n))  when (n < 10) (exit1 (show n))  
−  let ns  +  let ns = map digitToInt (show (n `div` 2)) 
n' < callCC $ \exit2 > do  n' < callCC $ \exit2 > do  
when ((length ns) < 3) (exit2 (length ns))  when ((length ns) < 3) (exit2 (length ns))  
when ((length ns) < 5) (exit2 n)  when ((length ns) < 5) (exit2 n)  
−  when ((length ns) < 7) $ do let ns'  +  when ((length ns) < 7) $ do let ns' = map intToDigit (reverse ns) 
exit1 (dropWhile (=='0') ns')  exit1 (dropWhile (=='0') ns')  
return $ sum ns  return $ sum ns  
−  return $ "(ns  +  return $ "(ns = " ++ (show ns) ++ ") " ++ (show n') 
return $ "Answer: " ++ str  return $ "Answer: " ++ str  
</haskell>  </haskell>  
Line 1,628:  Line 1,628:  
<haskell>  <haskell>  
toIO :: a > IO a  toIO :: a > IO a  
−  toIO x  +  toIO x = return x 
fun :: IO String  fun :: IO String  
−  fun  +  fun = do n < (readLn::IO Int)  this is an IO monad block 
convert n  convert n  
convert :: Int > IO String  convert :: Int > IO String  
−  convert n  +  convert n = (`runCont` id) $ do  this is a Cont monad block 
str < callCC $ \exit1 > do  str has type IO String  str < callCC $ \exit1 > do  str has type IO String  
when (n < 10) (exit1 $ toIO (show n))  when (n < 10) (exit1 $ toIO (show n))  
−  let ns  +  let ns = map digitToInt (show (n `div` 2)) 
n' < callCC $ \exit2 > do  n' has type IO Int  n' < callCC $ \exit2 > do  n' has type IO Int  
when ((length ns) < 3) (exit2 (toIO (length ns)))  when ((length ns) < 3) (exit2 (toIO (length ns)))  
Line 1,644:  Line 1,644:  
x < (readLn::IO Int)  x < (readLn::IO Int)  
return x)  return x)  
−  when ((length ns) < 7) $ do let ns'  +  when ((length ns) < 7) $ do let ns' = map intToDigit (reverse ns) 
exit1 $ toIO (dropWhile (=='0') ns')  exit1 $ toIO (dropWhile (=='0') ns')  
return (toIO (sum ns))  return (toIO (sum ns))  
return $ do num < n'  this is an IO monad block  return $ do num < n'  this is an IO monad block  
−  return $ "(ns  +  return $ "(ns = " ++ (show ns) ++ ") " ++ (show num) 
return $ do s < str  this is an IO monad block  return $ do s < str  this is an IO monad block  
return $ "Answer: " ++ s  return $ "Answer: " ++ s  
Line 1,658:  Line 1,658:  
<haskell>  <haskell>  
−  fun  +  fun = do n < (readLn::IO Int) 
return $ (`runCont` id) $ do  return $ (`runCont` id) $ do  
str < callCC $ \exit1 > do  str < callCC $ \exit1 > do  
when (n < 10) (exit1 (show n))  when (n < 10) (exit1 (show n))  
−  let ns  +  let ns = map digitToInt (show (n `div` 2)) 
n' < callCC $ \exit2 > do  n' < callCC $ \exit2 > do  
when ((length ns) < 3) (exit2 (length ns))  when ((length ns) < 3) (exit2 (length ns))  
when ((length ns) < 5) (exit2 n)  when ((length ns) < 5) (exit2 n)  
when ((length ns) < 7) $ do  when ((length ns) < 7) $ do  
−  let ns'  +  let ns' = map intToDigit (reverse ns) 
exit1 (dropWhile (=='0') ns')  exit1 (dropWhile (=='0') ns')  
return $ sum ns  return $ sum ns  
−  return $ "(ns  +  return $ "(ns = " ++ (show ns) ++ ") " ++ (show n') 
return $ "Answer: " ++ str  return $ "Answer: " ++ str  
</haskell>  </haskell>  
Line 1,677:  Line 1,677:  
<haskell>  <haskell>  
−  convert n  +  convert n = (`runCont` id) $ do 
str < callCC $ \exit1 > do  str < callCC $ \exit1 > do  
when (n < 10) (exit1 $ toIO (show n))  when (n < 10) (exit1 $ toIO (show n))  
−  let ns  +  let ns = map digitToInt (show (n `div` 2)) 
n' < callCC $ \exit2 > do  n' < callCC $ \exit2 > do  
when ((length ns) < 3) (exit2 (toIO (length ns)))  when ((length ns) < 3) (exit2 (toIO (length ns)))  
Line 1,688:  Line 1,688:  
return x)  return x)  
when ((length ns) < 7) $ do  when ((length ns) < 7) $ do  
−  let ns'  +  let ns' = map intToDigit (reverse ns) 
exit1 $ toIO (dropWhile (=='0') ns')  exit1 $ toIO (dropWhile (=='0') ns')  
return (toIO (sum ns))  return (toIO (sum ns))  
return $ do num < n'  return $ do num < n'  
−  return $ "(ns  +  return $ "(ns = " ++ (show ns) ++ ") " ++ (show num) 
return $ do s < str  return $ do s < str  
return $ "Answer: " ++ s  return $ "Answer: " ++ s  
Line 1,721:  Line 1,721:  
<haskell>  <haskell>  
fun :: IO String  fun :: IO String  
−  fun  +  fun = (`runContT` return) $ do 
n < liftIO (readLn::IO Int)  n < liftIO (readLn::IO Int)  
str < callCC $ \exit1 > do  define "exit1"  str < callCC $ \exit1 > do  define "exit1"  
when (n < 10) (exit1 (show n))  when (n < 10) (exit1 (show n))  
−  let ns  +  let ns = map digitToInt (show (n `div` 2)) 
n' < callCC $ \exit2 > do  define "exit2"  n' < callCC $ \exit2 > do  define "exit2"  
when ((length ns) < 3) (exit2 (length ns))  when ((length ns) < 3) (exit2 (length ns))  
Line 1,731:  Line 1,731:  
x < liftIO (readLn::IO Int)  x < liftIO (readLn::IO Int)  
exit2 x  exit2 x  
−  when ((length ns) < 7) $ do let ns'  +  when ((length ns) < 7) $ do let ns' = map intToDigit (reverse ns) 
exit1 (dropWhile (=='0') ns') escape 2 levels  exit1 (dropWhile (=='0') ns') escape 2 levels  
return $ sum ns  return $ sum ns  
−  return $ "(ns  +  return $ "(ns = " ++ (show ns) ++ ") " ++ (show n') 
return $ "Answer: " ++ str  return $ "Answer: " ++ str  
</haskell>  </haskell>  
Line 1,743:  Line 1,743:  
<haskell>  <haskell>  
−  fun  +  fun = do n < (readLn::IO Int) 
return $ (`runCont` id) $ do  return $ (`runCont` id) $ do  
str < callCC $ \exit1 > do  str < callCC $ \exit1 > do  
when (n < 10) (exit1 (show n))  when (n < 10) (exit1 (show n))  
−  let ns  +  let ns = map digitToInt (show (n `div` 2)) 
n' < callCC $ \exit2 > do  n' < callCC $ \exit2 > do  
when ((length ns) < 3) (exit2 (length ns))  when ((length ns) < 3) (exit2 (length ns))  
when ((length ns) < 5) (exit2 n)  when ((length ns) < 5) (exit2 n)  
when ((length ns) < 7) $ do  when ((length ns) < 7) $ do  
−  let ns'  +  let ns' = map intToDigit (reverse ns) 
exit1 (dropWhile (=='0') ns')  exit1 (dropWhile (=='0') ns')  
return $ sum ns  return $ sum ns  
−  return $ "(ns  +  return $ "(ns = " ++ (show ns) ++ ") " ++ (show n') 
return $ "Answer: " ++ str  return $ "Answer: " ++ str  
</haskell>  </haskell>  
Line 1,762:  Line 1,762:  
<haskell>  <haskell>  
−  fun  +  fun = (`runContT` return) $ do 
n < liftIO (readLn::IO Int)  n < liftIO (readLn::IO Int)  
str < callCC $ \exit1 > do  str < callCC $ \exit1 > do  
when (n < 10) (exit1 (show n))  when (n < 10) (exit1 (show n))  
−  let ns  +  let ns = map digitToInt (show (n `div` 2)) 
n' < callCC $ \exit2 > do  n' < callCC $ \exit2 > do  
when ((length ns) < 3) (exit2 (length ns))  when ((length ns) < 3) (exit2 (length ns))  
Line 1,774:  Line 1,774:  
exit2 x  exit2 x  
when ((length ns) < 7) $ do  when ((length ns) < 7) $ do  
−  let ns'  +  let ns' = map intToDigit (reverse ns) 
exit1 (dropWhile (=='0') ns')  exit1 (dropWhile (=='0') ns')  
return $ sum ns  return $ sum ns  
−  return $ "(ns  +  return $ "(ns = " ++ (show ns) ++ ") " ++ (show n') 
return $ "Answer: " ++ str  return $ "Answer: " ++ str  
</haskell>  </haskell>  
Line 1,855:  Line 1,855:  
<haskell>  <haskell>  
−  newtype State s a  +  newtype State s a = State { runState :: (s > (a,s)) } 
</haskell>  </haskell>  
the StateT transformer is built upon the definition  the StateT transformer is built upon the definition  
<haskell>  <haskell>  
−  newtype StateT s m a  +  newtype StateT s m a = StateT { runStateT :: (s > m (a,s)) } 
</haskell>  </haskell>  
<code>State s</code> is an instance of both the <code>Monad</code> class and the <code>MonadState s</code> class, so <code>StateT s m</code> should also be members of the <code>Monad</code> and <code>MonadState s</code> classes. Furthermore, if <code>m</code> is an instance of <code>MonadPlus</code>, <code>StateT s m</code> should also be a member of <code>MonadPlus</code>.  <code>State s</code> is an instance of both the <code>Monad</code> class and the <code>MonadState s</code> class, so <code>StateT s m</code> should also be members of the <code>Monad</code> and <code>MonadState s</code> classes. Furthermore, if <code>m</code> is an instance of <code>MonadPlus</code>, <code>StateT s m</code> should also be a member of <code>MonadPlus</code>.  
Line 1,867:  Line 1,867:  
<haskell>  <haskell>  
−  newtype StateT s m a  +  newtype StateT s m a = StateT { runStateT :: (s > m (a,s)) } 
instance (Monad m) ==> Monad (StateT s m) where  instance (Monad m) ==> Monad (StateT s m) where  
−  return a  +  return a = StateT $ \s > return (a,s) 
−  (StateT x) >>  +  (StateT x) >>= f = StateT $ \s > do (v,s') < x s  get new value, state 
(StateT x') < return $ f v  apply bound function to get new state transformation fn  (StateT x') < return $ f v  apply bound function to get new state transformation fn  
x' s'  apply the state transformation fn to the new state  x' s'  apply the state transformation fn to the new state  
Line 1,881:  Line 1,881:  
<haskell>  <haskell>  
instance (Monad m) ==> MonadState s (StateT s m) where  instance (Monad m) ==> MonadState s (StateT s m) where  
−  get  +  get = StateT $ \s > return (s,s) 
−  put s  +  put s = StateT $ \_ > return ((),s) 
</haskell>  </haskell>  
Finally, we want to declare all combined monads in which <code>StateT</code> is used with an instance of <code>MonadPlus</code> to be instances of <code>MonadPlus</code>:  Finally, we want to declare all combined monads in which <code>StateT</code> is used with an instance of <code>MonadPlus</code> to be instances of <code>MonadPlus</code>:  
Line 1,888:  Line 1,888:  
<haskell>  <haskell>  
instance (MonadPlus m) ==> MonadPlus (StateT s m) where  instance (MonadPlus m) ==> MonadPlus (StateT s m) where  
−  mzero  +  mzero = StateT $ \s > mzero 
−  (StateT x1) `mplus` (StateT x2)  +  (StateT x1) `mplus` (StateT x2) = StateT $ \s > (x1 s) `mplus` (x2 s) 
</haskell>  </haskell>  
=== Defining the lifting function ===  === Defining the lifting function ===  
Line 1,897:  Line 1,897:  
<haskell>  <haskell>  
instance MonadTrans (StateT s) where  instance MonadTrans (StateT s) where  
−  lift c  +  lift c = StateT $ \s > c >>= (\x > return (x,s)) 
</haskell>  </haskell>  
The <code>lift</code> function creates a <code>StateT</code> state transformation function that binds the computation in the inner monad to a function that packages the result with the input state. The result is that a function that returns a list (i.e., a computation in the List monad) can be lifted into <code>StateT s []</code>, where it becomes a function that returns a <code>StateT (s > [(a,s)])</code>. That is, the lifted computation produces ''multiple'' (value,state) pairs from its input state. The effect of this is to "fork" the computation in StateT, creating a different branch of the computation for each value in the list returned by the lifted function. Of course, applying <code>StateT</code> to a different monad will produce different semantics for the <code>lift</code> function.  The <code>lift</code> function creates a <code>StateT</code> state transformation function that binds the computation in the inner monad to a function that packages the result with the input state. The result is that a function that returns a list (i.e., a computation in the List monad) can be lifted into <code>StateT s []</code>, where it becomes a function that returns a <code>StateT (s > [(a,s)])</code>. That is, the lifted computation produces ''multiple'' (value,state) pairs from its input state. The effect of this is to "fork" the computation in StateT, creating a different branch of the computation for each value in the list returned by the lifted function. Of course, applying <code>StateT</code> to a different monad will produce different semantics for the <code>lift</code> function.  
Line 1,919:  Line 1,919:  
<haskell>  <haskell>  
 this is the format of our log entries   this is the format of our log entries  
−  data Entry  +  data Entry = Log {timestamp::ClockTime, msg::String} deriving Eq 
instance Show Entry where  instance Show Entry where  
−  show (Log t s)  +  show (Log t s) = (show t) ++ "  " ++ s 
 this is the combined monad type   this is the combined monad type  
−  type LogWriter a  +  type LogWriter a = WriterT [Entry] IO a 
 add a message to the log   add a message to the log  
logMsg :: String > LogWriter ()  logMsg :: String > LogWriter ()  
−  logMsg s  +  logMsg s = do t < liftIO getClockTime 
tell [Log t s]  tell [Log t s]  
 this handles one packet   this handles one packet  
filterOne :: [Rule] > Packet > LogWriter (Maybe Packet)  filterOne :: [Rule] > Packet > LogWriter (Maybe Packet)  
−  filterOne rules packet  +  filterOne rules packet = do rule < return (match rules packet) 
case rule of  case rule of  
Nothing > do logMsg ("DROPPING UNMATCHED PACKET: " ++ (show packet))  Nothing > do logMsg ("DROPPING UNMATCHED PACKET: " ++ (show packet))  
Line 1,946:  Line 1,946:  
 and a log of the activity   and a log of the activity  
filterAll :: [Rule] > [Packet] > LogWriter [Packet]  filterAll :: [Rule] > [Packet] > LogWriter [Packet]  
−  filterAll rules packets  +  filterAll rules packets = do logMsg "STARTING PACKET FILTER" 
out < mapM (filterOne rules) packets  out < mapM (filterOne rules) packets  
logMsg "STOPPING PACKET FILTER"  logMsg "STOPPING PACKET FILTER"  
Line 1,955:  Line 1,955:  
 a log generated during the computation.   a log generated during the computation.  
main :: IO ()  main :: IO ()  
−  main  +  main = do args < getArgs 
ruleData < readFile (args!!0)  ruleData < readFile (args!!0)  
packetData < readFile (args!!1)  packetData < readFile (args!!1)  
−  let rules  +  let rules = (read ruleData)::[Rule] 
−  packets  +  packets = (read packetData)::[Packet] 
(out,log) < runWriterT (filterAll rules packets)  (out,log) < runWriterT (filterAll rules packets)  
putStrLn "ACCEPTED PACKETS"  putStrLn "ACCEPTED PACKETS"  
Line 1,966:  Line 1,966:  
putStr (unlines (map show log))  putStr (unlines (map show log))  
</haskell>  </haskell>  
+  
=== ReaderT with IO ===  === ReaderT with IO ===  
Line 2,151:  Line 2,152:  
<haskell>  <haskell>  
 First, we develop a language to express logic problems   First, we develop a language to express logic problems  
−  type Var  +  type Var = String 
−  type Value  +  type Value = String 
−  data Predicate  +  data Predicate = Is Var Value  var has specific value 
 Equal Var Var  vars have same (unspecified) value   Equal Var Var  vars have same (unspecified) value  
 And Predicate Predicate  both are true   And Predicate Predicate  both are true  
Line 2,160:  Line 2,161:  
deriving (Eq, Show)  deriving (Eq, Show)  
−  type Variables  +  type Variables = [(Var,Value)] 
 test for a variable NOT equaling a value   test for a variable NOT equaling a value  
isNot :: Var > Value > Predicate  isNot :: Var > Value > Predicate  
−  isNot var value  +  isNot var value = Not (Is var value) 
 if a is true, then b must also be true   if a is true, then b must also be true  
implies :: Predicate > Predicate > Predicate  implies :: Predicate > Predicate > Predicate  
−  implies a b  +  implies a b = Not (a `And` (Not b)) 
 exclusive or   exclusive or  
orElse :: Predicate > Predicate > Predicate  orElse :: Predicate > Predicate > Predicate  
−  orElse a b  +  orElse a b = (a `And` (Not b)) `Or` ((Not a) `And` b) 
 Check a predicate with the given variable bindings.   Check a predicate with the given variable bindings.  
 An unbound variable causes a Nothing return value.   An unbound variable causes a Nothing return value.  
check :: Predicate > Variables > Maybe Bool  check :: Predicate > Variables > Maybe Bool  
−  check (Is var value) vars  +  check (Is var value) vars = do val < lookup var vars 
−  return (val  +  return (val == value) 
−  check (Equal v1 v2) vars  +  check (Equal v1 v2) vars = do val1 < lookup v1 vars 
val2 < lookup v2 vars  val2 < lookup v2 vars  
−  return (val1  +  return (val1 == val2) 
−  check (And p1 p2) vars  +  check (And p1 p2) vars = liftM2 (&&) (check p1 vars) (check p2 vars) 
−  check (Or p1 p2) vars  +  check (Or p1 p2) vars = liftM2 () (check p1 vars) (check p2 vars) 
−  check (Not p) vars  +  check (Not p) vars = liftM (not) (check p vars) 
</haskell>  </haskell>  
Line 2,191:  Line 2,192:  
<haskell>  <haskell>  
 this is the type of our logic problem   this is the type of our logic problem  
−  data ProblemState  +  data ProblemState = PS {vars::Variables, constraints::[Predicate]} 
 this is our monad type for nondeterminstic computations with state   this is our monad type for nondeterminstic computations with state  
−  type NDS a  +  type NDS a = StateT ProblemState [] a 
 lookup a variable   lookup a variable  
getVar :: Var > NDS (Maybe Value)  getVar :: Var > NDS (Maybe Value)  
−  getVar v  +  getVar v = do vs < gets vars 
return $ lookup v vs  return $ lookup v vs  
 set a variable   set a variable  
setVar :: Var > Value > NDS ()  setVar :: Var > Value > NDS ()  
−  setVar v x  +  setVar v x = do st < get 
vs' < return $ filter ((v/=).fst) (vars st)  vs' < return $ filter ((v/=).fst) (vars st)  
put $ st {vars=(v,x):vs'}  put $ st {vars=(v,x):vs'}  
Line 2,213:  Line 2,214:  
 False at the end to signify that all solutions should be complete.   False at the end to signify that all solutions should be complete.  
isConsistent :: Bool > NDS Bool  isConsistent :: Bool > NDS Bool  
−  isConsistent partial  +  isConsistent partial = do cs < gets constraints 
vs < gets vars  vs < gets vars  
−  let results  +  let results = map (\p>check p vs) cs 
return $ and (map (maybe partial id) results)  return $ and (map (maybe partial id) results)  
 Return only the variable bindings that are complete consistent solutions.   Return only the variable bindings that are complete consistent solutions.  
getFinalVars :: NDS Variables  getFinalVars :: NDS Variables  
−  getFinalVars  +  getFinalVars = do c < isConsistent False 
guard c  guard c  
gets vars  gets vars  
Line 2,228:  Line 2,229:  
 or Nothing if there was no solution.   or Nothing if there was no solution.  
getSolution :: NDS a > ProblemState > Maybe a  getSolution :: NDS a > ProblemState > Maybe a  
−  getSolution c i  +  getSolution c i = listToMaybe (evalStateT c i) 
 Get a list of all possible solutions to the problem by evaluating the solver   Get a list of all possible solutions to the problem by evaluating the solver  
 computation with an initial problem state.   computation with an initial problem state.  
getAllSolutions :: NDS a > ProblemState > [a]  getAllSolutions :: NDS a > ProblemState > [a]  
−  getAllSolutions c i  +  getAllSolutions c i = evalStateT c i 
</haskell>  </haskell>  
We are ready to apply the predicate language and stateful nondeterministic monad to solving a logic problem. For this example, we will use the wellknown Kalotan puzzle which appeared in ''Mathematical BrainTeasers'', Dover Publications (1976), by J. A. H. Hunter.  We are ready to apply the predicate language and stateful nondeterministic monad to solving a logic problem. For this example, we will use the wellknown Kalotan puzzle which appeared in ''Mathematical BrainTeasers'', Dover Publications (1976), by J. A. H. Hunter.  
Line 2,243:  Line 2,244:  
 if a male says something, it must be true   if a male says something, it must be true  
said :: Var > Predicate > Predicate  said :: Var > Predicate > Predicate  
−  said v p  +  said v p = (v `Is` "male") `implies` p 
 if a male says two things, they must be true   if a male says two things, they must be true  
 if a female says two things, one must be true and one must be false   if a female says two things, one must be true and one must be false  
saidBoth :: Var > Predicate > Predicate > Predicate  saidBoth :: Var > Predicate > Predicate > Predicate  
−  saidBoth v p1 p2  +  saidBoth v p1 p2 = And ((v `Is` "male") `implies` (p1 `And` p2)) 
((v `Is` "female") `implies` (p1 `orElse` p2))  ((v `Is` "female") `implies` (p1 `orElse` p2))  
 lying is saying something is true when it isn't or saying something isn't true when it is   lying is saying something is true when it isn't or saying something isn't true when it is  
lied :: Var > Predicate > Predicate  lied :: Var > Predicate > Predicate  
−  lied v p  +  lied v p = ((v `said` p) `And` (Not p)) `orElse` ((v `said` (Not p)) `And` p) 
 Test consistency over all allowed settings of the variable.   Test consistency over all allowed settings of the variable.  
tryAllValues :: Var > NDS ()  tryAllValues :: Var > NDS ()  
−  tryAllValues var  +  tryAllValues var = do (setVar var "male") `mplus` (setVar var "female") 
c < isConsistent True  c < isConsistent True  
guard c  guard c  
Line 2,267:  Line 2,268:  
 Define the problem, try all of the variable assignments and print a solution.   Define the problem, try all of the variable assignments and print a solution.  
main :: IO ()  main :: IO ()  
−  main  +  main = do let variables = [] 
−  constraints  +  constraints = [ Not (Equal "parent1" "parent2"), 
"parent1" `said` ("child" `said` ("child" `Is` "male")),  "parent1" `said` ("child" `said` ("child" `Is` "male")),  
saidBoth "parent2" ("child" `Is` "female")  saidBoth "parent2" ("child" `Is` "female")  
("child" `lied` ("child" `Is` "male")) ]  ("child" `lied` ("child" `Is` "male")) ]  
−  problem  +  problem = PS variables constraints 
print $ (`getSolution` problem) $ do tryAllValues "parent1"  print $ (`getSolution` problem) $ do tryAllValues "parent1"  
tryAllValues "parent2"  tryAllValues "parent2"  
Line 2,305:  Line 2,306:  
<haskell>  <haskell>  
 this is the type of our problem description   this is the type of our problem description  
−  data NQueensProblem  +  data NQueensProblem = NQP {board::Board, 
ranks::[Rank], files::[File],  ranks::[Rank], files::[File],  
asc::[Diagonal], desc::[Diagonal]}  asc::[Diagonal], desc::[Diagonal]}  
−   initial state  +   initial state = empty board, all ranks, files, and diagonals free 
−  initialState  +  initialState = let fileA = map (\r>Pos A r) [1..8] 
−  rank8  +  rank8 = map (\f>Pos f 8) [A .. H] 
−  rank1  +  rank1 = map (\f>Pos f 1) [A .. H] 
−  asc  +  asc = map Ascending (nub (fileA ++ rank1)) 
−  desc  +  desc = map Descending (nub (fileA ++ rank8)) 
in NQP (Board []) [1..8] [A .. H] asc desc  in NQP (Board []) [1..8] [A .. H] asc desc  
 this is our combined monad type for this problem   this is our combined monad type for this problem  
−  type NDS a  +  type NDS a = WriterT [String] (StateT NQueensProblem []) a 
 Get the first solution to the problem, by evaluating the solver computation with   Get the first solution to the problem, by evaluating the solver computation with  
Line 2,324:  Line 2,325:  
 or Nothing if there was no solution.   or Nothing if there was no solution.  
getSolution :: NDS a > NQueensProblem > Maybe (a,[String])  getSolution :: NDS a > NQueensProblem > Maybe (a,[String])  
−  getSolution c i  +  getSolution c i = listToMaybe (evalStateT (runWriterT c) i) 
 add a Queen to the board in a specific position   add a Queen to the board in a specific position  
addQueen :: Position > NDS ()  addQueen :: Position > NDS ()  
−  addQueen p  +  addQueen p = do (Board b) < gets board 
rs < gets ranks  rs < gets ranks  
fs < gets files  fs < gets files  
as < gets asc  as < gets asc  
ds < gets desc  ds < gets desc  
−  let b'  +  let b' = (Piece Black Queen, p):b 
−  rs'  +  rs' = delete (rank p) rs 
−  fs'  +  fs' = delete (file p) fs 
−  (a,d)  +  (a,d) = getDiags p 
−  as'  +  as' = delete a as 
−  ds'  +  ds' = delete d ds 
tell ["Added Queen at " ++ (show p)]  tell ["Added Queen at " ++ (show p)]  
put (NQP (Board b') rs' fs' as' ds')  put (NQP (Board b') rs' fs' as' ds')  
Line 2,344:  Line 2,345:  
 test if a position is in the set of allowed diagonals   test if a position is in the set of allowed diagonals  
inDiags :: Position > NDS Bool  inDiags :: Position > NDS Bool  
−  inDiags p  +  inDiags p = do let (a,d) = getDiags p 
as < gets asc  as < gets asc  
ds < gets desc  ds < gets desc  
Line 2,351:  Line 2,352:  
 add a Queen to the board in all allowed positions   add a Queen to the board in all allowed positions  
addQueens :: NDS ()  addQueens :: NDS ()  
−  addQueens  +  addQueens = do rs < gets ranks 
fs < gets files  fs < gets files  
allowed < filterM inDiags [Pos f r  f < fs, r < rs]  allowed < filterM inDiags [Pos f r  f < fs, r < rs]  
Line 2,360:  Line 2,361:  
 then get the board and print the solution along with the log   then get the board and print the solution along with the log  
main :: IO ()  main :: IO ()  
−  main  +  main = do args < getArgs 
−  let n  +  let n = read (args!!0) 
−  cmds  +  cmds = replicate n addQueens 
−  sol  +  sol = (`getSolution` initialState) $ do sequence_ cmds 
gets board  gets board  
case sol of  case sol of  
Line 2,382:  Line 2,383:  
<haskell>  <haskell>  
logString :: String > StateT MyState (WriterT [String] []) Int  logString :: String > StateT MyState (WriterT [String] []) Int  
−  logString s  +  logString s = ... 
</haskell>  </haskell>  
we can write clearer, more flexible code like:  we can write clearer, more flexible code like:  
Line 2,388:  Line 2,389:  
<haskell>  <haskell>  
logString :: (MonadWriter [String] m) ==> String > m Int  logString :: (MonadWriter [String] m) ==> String > m Int  
−  logString s  +  logString s = ... 
</haskell>  </haskell>  
and then lift the <code>logString</code> computation into the combined monad when we use it.  and then lift the <code>logString</code> computation into the combined monad when we use it.  
Line 2,398:  Line 2,399:  
<haskell>  <haskell>  
−  liftListToState  +  liftListToState = lift . lift . lift 
</haskell>  </haskell>  
Then, the code is more informative and if the transformer stack changes, the impact on the lifting code is confined to a small number of these helper functions.  Then, the code is more informative and if the transformer stack changes, the impact on the lifting code is confined to a small number of these helper functions.  
Line 2,408:  Line 2,409:  
<haskell>  <haskell>  
 this is our combined monad type for this problem   this is our combined monad type for this problem  
−  type NDS a  +  type NDS a = StateT Int (WriterT [String] []) a 
{ Here is a computation on lists }  { Here is a computation on lists }  
Line 2,414:  Line 2,415:  
 return the digits of a number as a list   return the digits of a number as a list  
getDigits :: Int > [Int]  getDigits :: Int > [Int]  
−  getDigits n  +  getDigits n = let s = (show n) 
in map digitToInt s  in map digitToInt s  
Line 2,421:  Line 2,422:  
 write a value to a log and return that value   write a value to a log and return that value  
logVal :: (MonadWriter [String] m) ==> Int > m Int  logVal :: (MonadWriter [String] m) ==> Int > m Int  
−  logVal n  +  logVal n = do tell ["logVal: " ++ (show n)] 
return n  return n  
 do a logging computation and return the length of the log it wrote   do a logging computation and return the length of the log it wrote  
getLogLength :: (MonadWriter [[a]] m) ==> m b > m Int  getLogLength :: (MonadWriter [[a]] m) ==> m b > m Int  
−  getLogLength c  +  getLogLength c = do (_,l) < listen $ c 
return (length (concat l))  return (length (concat l))  
 log a string value and return 0   log a string value and return 0  
logString :: (MonadWriter [String] m) ==> String > m Int  logString :: (MonadWriter [String] m) ==> String > m Int  
−  logString s  +  logString s = do tell ["logString: " ++ s] 
return 0  return 0  
Line 2,438:  Line 2,439:  
 "Fork" the computation and log each list item in a different branch.   "Fork" the computation and log each list item in a different branch.  
logEach :: (Show a) ==> [a] > WriterT [String] [] a  logEach :: (Show a) ==> [a] > WriterT [String] [] a  
−  logEach xs  +  logEach xs = do x < lift xs 
tell ["logEach: " ++ (show x)]  tell ["logEach: " ++ (show x)]  
return x  return x  
Line 2,446:  Line 2,447:  
 increment the state by a specified value   increment the state by a specified value  
addVal :: (MonadState Int m) ==> Int > m ()  addVal :: (MonadState Int m) ==> Int > m ()  
−  addVal n  +  addVal n = do x < get 
put (x+n)  put (x+n)  
Line 2,453:  Line 2,454:  
 set the state to a given value, and log that value   set the state to a given value, and log that value  
setVal :: Int > NDS ()  setVal :: Int > NDS ()  
−  setVal n  +  setVal n = do x < lift $ logVal n 
put x  put x  
Line 2,459:  Line 2,460:  
 Because setVal is used, the new values are logged as well.   Because setVal is used, the new values are logged as well.  
addDigits :: Int > NDS ()  addDigits :: Int > NDS ()  
−  addDigits n  +  addDigits n = do x < get 
y < lift . lift $ getDigits n  y < lift . lift $ getDigits n  
setVal (x+y)  setVal (x+y)  
Line 2,465:  Line 2,466:  
{ an equivalent construction is:  { an equivalent construction is:  
addDigits :: Int > NDS ()  addDigits :: Int > NDS ()  
−  addDigits n  +  addDigits n = do x < get 
msum (map (\i>setVal (x+i)) (getDigits n))  msum (map (\i>setVal (x+i)) (getDigits n))  
}  }  
Line 2,475:  Line 2,476:  
}  }  
liftListToNDS :: [a] > NDS a  liftListToNDS :: [a] > NDS a  
−  liftListToNDS  +  liftListToNDS = lift . lift 
 perform a series of computations in the combined monad, lifting computations from other   perform a series of computations in the combined monad, lifting computations from other  
 monads as necessary.   monads as necessary.  
main :: IO ()  main :: IO ()  
−  main  +  main = do mapM_ print $ runWriterT $ (`evalStateT` 0) $ do x < lift $ getLogLength $ logString "hello" 
addDigits x  addDigits x  
x < lift $ logEach [1,3,5]  x < lift $ logEach [1,3,5]  
Line 2,530:  Line 2,531:  
<haskell>  <haskell>  
 the basic types we are dealing with   the basic types we are dealing with  
−  type Wood  +  type Wood = ... 
−  type Chopsticks  +  type Chopsticks = ... 
−  data Wrapper x  +  data Wrapper x = Wrapper x 
 NOTE: the Tray type comes from the Tray monad   NOTE: the Tray type comes from the Tray monad  
Line 2,538:  Line 2,539:  
 worker function 1: makes roughly shaped chopsticks   worker function 1: makes roughly shaped chopsticks  
makeChopsticks :: Wood > Tray Chopsticks  makeChopsticks :: Wood > Tray Chopsticks  
−  makeChopsticks w  +  makeChopsticks w = ... 
 worker function 2: polishes chopsticks   worker function 2: polishes chopsticks  
polishChopsticks :: Chopsticks > Tray Chopsticks  polishChopsticks :: Chopsticks > Tray Chopsticks  
−  polishChopsticks c  +  polishChopsticks c = ... 
 worker function 3: wraps chopsticks   worker function 3: wraps chopsticks  
wrapChopsticks :: Chopsticks > Tray Wrapper Chopsticks  wrapChopsticks :: Chopsticks > Tray Wrapper Chopsticks  
−  wrapChopsticks c  +  wrapChopsticks c = ... 
</haskell>  </haskell>  
It is clear that the worker machines contain all of the functionality needed to produce chopsticks. What is missing is the specification of the trays, loader, and combiner machines that collectively make up the Tray monad. Our trays should either be empty or contain a single item. Our loader machine would simply take an item and place it in a tray on the conveyor belt. The combiner machine would take each input tray and pass along empty trays while feeding the contents of nonempty trays to its worker machine. In Haskell, we would define the <code>Tray</code> monad as:  It is clear that the worker machines contain all of the functionality needed to produce chopsticks. What is missing is the specification of the trays, loader, and combiner machines that collectively make up the Tray monad. Our trays should either be empty or contain a single item. Our loader machine would simply take an item and place it in a tray on the conveyor belt. The combiner machine would take each input tray and pass along empty trays while feeding the contents of nonempty trays to its worker machine. In Haskell, we would define the <code>Tray</code> monad as:  
Line 2,552:  Line 2,553:  
<haskell>  <haskell>  
 trays are either empty or contain a single item   trays are either empty or contain a single item  
−  data Tray x  +  data Tray x = Empty  Contains x 
 Tray is a monad   Tray is a monad  
instance Monad Tray where  instance Monad Tray where  
−  Empty >>  +  Empty >>= _ = Empty 
−  (Contains x) >>  +  (Contains x) >>= worker = worker x 
−  return  +  return = Contains 
−  fail _  +  fail _ = Empty 
</haskell>  </haskell>  
[[Image:info.png]] You may recognize the <code>Tray</code> monad as a disguised version of the <code>Maybe</code> monad that is a standard part of Haskell 2010 library. <br />  [[Image:info.png]] You may recognize the <code>Tray</code> monad as a disguised version of the <code>Maybe</code> monad that is a standard part of Haskell 2010 library. <br />  
Line 2,581:  Line 2,582:  
<haskell>  <haskell>  
assemblyLine :: Wood > Tray Wrapped Chopsticks  assemblyLine :: Wood > Tray Wrapped Chopsticks  
−  assemblyLine w  +  assemblyLine w = (return w) >>= makeChopsticks >>= polishChopsticks >>= wrapChopsticks 
</haskell>  </haskell>  
or using the built in Haskell "do" notation for monads:  or using the built in Haskell "do" notation for monads:  
Line 2,587:  Line 2,588:  
<haskell>  <haskell>  
assemblyLine :: Wood > Tray Wrapped Chopsticks  assemblyLine :: Wood > Tray Wrapped Chopsticks  
−  assemblyLine w  +  assemblyLine w = do c < makeChopsticks w 
c' < polishChopsticks c  c' < polishChopsticks c  
c'' < wrapChopsticks c'  c'' < wrapChopsticks c'  
Line 2,602:  Line 2,603:  
<haskell>  <haskell>  
 tray2s either contain a single item or contain a failure report   tray2s either contain a single item or contain a failure report  
−  data Tray2 x  +  data Tray2 x = Contains x  Failed String 
 Tray2 is a monad   Tray2 is a monad  
instance Monad Tray2 where  instance Monad Tray2 where  
−  (Failed reason) >>  +  (Failed reason) >>= _ = Failed reason 
−  (Contains x) >>  +  (Contains x) >>= worker = worker x 
−  return  +  return = Contains 
−  fail reason  +  fail reason = Failed reason 
</haskell>  </haskell>  
[[Image:info.png]] You may recognize the <code>Tray2</code> monad as a disguised version of the <code>Error</code> monad that is a standard part of the Haskell 2010 libraries.<br />  [[Image:info.png]] You may recognize the <code>Tray2</code> monad as a disguised version of the <code>Error</code> monad that is a standard part of the Haskell 2010 libraries.<br /> 
Revision as of 14:04, 3 November 2019
All About Monads is a tutorial on monads and monad transformers and a walkthrough of common monad instances. You can download a PDF version here. And here is a version of the article which includes source code.
Contents
 1 Understanding Monads
 1.1 Introduction
 1.2 Meet the Monads
 1.3 Doing it with class
 1.4 The monad laws
 1.5 Exercises
 1.6 Monad support in Haskell
 2 A Catalog of Standard Monads
 3 Monads in the Real World
 3.1 Introduction
 3.2 Combining monads the hard way
 3.3 Monad transformers
 3.4 Standard monad transformers
 3.5 Anatomy of a monad transformer
 3.6 More examples with monad transformers
 3.7 Managing the transformer stack
 3.8 Continuing Exploration
 3.9 A physical analogy for monads
 3.10 Haskell code examples
 3.10.1 Example 1
 3.10.2 Example 2
 3.10.3 Example 3
 3.10.4 Example 4
 3.10.5 Example 5
 3.10.6 Example 6
 3.10.7 Example 7
 3.10.8 Example 8
 3.10.9 Example 9
 3.10.10 Example 10
 3.10.11 Example 11
 3.10.12 Example 12
 3.10.13 Example 13
 3.10.14 Example 14
 3.10.15 Example 15
 3.10.16 Example 16
 3.10.17 Example 17
 3.10.18 Example 18
 3.10.19 Example 19
 3.10.20 Example 20
 3.10.21 Example 21
 3.10.22 Example 22
 3.10.23 Example 23
 3.10.24 Example 24
 3.10.25 Example 25
 3.10.26 Example 26
Understanding Monads
Introduction
What is a monad?
A monad is a way to structure computations in terms of values and sequences of computations using those values. Monads allow the programmer to build up computations using sequential building blocks, which can themselves be sequences of computations. The monad determines how combined computations form a new computation and frees the programmer from having to code the combination manually each time it is required.
It is useful to think of a monad as a strategy for combining computations into more complex computations. For example, you should be familiar with the Maybe
type in Haskell:
data Maybe a = Nothing  Just a
which represents the type of computations which may fail to return a result. The Maybe
type suggests a strategy for combining computations which return Maybe
values: if a combined computation consists of one computation B
that depends on the result of another computation A
, then the combined computation should yield Nothing
whenever either A
or B
yield Nothing
and the combined computation should yield the result of B
applied to the result of A
when both computations succeed.
Other monads exist for building computations that perform I/O, have state, may return multiple results, etc. There are as many different type of monads as there are strategies for combining computations, but there are certain monads that are especially useful and are common enough that they are part of the standard Haskell 2010 libraries. These monads are each described in Part II.
Why should I make the effort to understand monads?
The sheer number of different monad tutorials on the internet is a good indication of the difficulty many people have understanding the concept. This is due to the abstract nature of monads and to the fact that they are used in several different capacities, which can confuse the picture of exactly what a monad is and what it is good for.
In Haskell, monads play a central role in the I/O system. It is not essential to understand monads to do I/O in Haskell, but understanding the I/O monad will improve your code and extend your capabilities.
For the programmer, monads are useful tools for structuring functional programs. They have three properties that make them especially useful:
 Modularity  They allow computations to be composed from simpler computations and separate the combination strategy from the actual computations being performed.
 Flexibility  They allow functional programs to be much more adaptable than equivalent programs written without monads. This is because the monad distills the computational strategy into a single place instead of requiring it be distributed throughout the entire program.
 Isolation  They can be used to create imperativestyle computational structures which remain safely isolated from the main body of the functional program. This is useful for incorporating sideeffects (such as I/O) and state (which violates referential transparency) into a pure functional language like Haskell.
Each of these features will be revisited later in the tutorial in the context of specific monads.
Meet the Monads
We will use the Maybe
type constructor throughout this chapter, so you should familiarize yourself with the definition and usage of Maybe
before continuing.
Type constructors
To understand monads in Haskell, you need to be comfortable dealing with type constructors. A type constructor is a parameterized type definition used with polymorphic types. By supplying a type constructor with one or more concrete types, you can construct a new concrete type in Haskell. In the definition of Maybe
:
data Maybe a = Nothing  Just a
Maybe
is a type constructor and Nothing
and Just
are data constructors. You can construct a data value by applying the Just
data constructor to a value:
country = Just "China"
In the same way, you can construct a type by applying the Maybe
type constructor to a type:
lookupAge :: DB > String > Maybe Int
Polymorphic types are like containers that are capable of holding values of many different types. So Maybe Int
can be thought of as a Maybe
container holding an Int
value (or Nothing
) and Maybe String
would be a Maybe
container holding a String
value (or Nothing
). In Haskell, we can also make the type of the container polymorphic, so we could write "m a
" to represent a container of some type holding a value of some type!
We often use type variables with type constructors to describe abstract features of a computation. For example, the polymorphic type Maybe a
is the type of all computations that may return a value or Nothing
. In this way, we can talk about the properties of the container apart from any details of what the container might hold.
File:Info.png If you get messages about "kind errors" from the compiler when working with monads, it means that you are not using the type constructors correctly.
Maybe a monad
In Haskell a monad is represented as a type constructor (call it m
), a function that builds values of that type (a > m a
), and a function that combines values of that type with computations that produce values of that type to produce a new computation for values of that type (m a > (a > m b) > m b
). Note that the container is the same, but the type of the contents of the container can change. It is customary to call the monad type constructor "m
" when discussing monads in general. The function that builds values of that type is traditionally called "return
" and the third function is known as "bind" but is written ">>=
". The signatures of the functions are:
 the type of monad m
data m a = ...
 return takes a value and embeds it in the monad.
return :: a > m a
 bind is a function that combines a monad instance m a with a computation
 that produces another monad instance m b from a's to produce a new
 monad instance m b
(>>=) :: m a > (a > m b) > m b
Roughly speaking, the monad type constructor defines a type of computation, the return
function creates primitive values of that computation type and >>=
combines computations of that type together to make more complex computations of that type. Using the container analogy, the type constructor m
is a container that can hold different values. m a
is a container holding a value of type a
. The return
function puts a value into a monad container. The >>=
function takes the value from a monad container and passes it to a function to produce a monad container containing a new value, possibly of a different type. The >>=
function is known as "bind" because it binds the value in a monad container to the first argument of a function. By adding logic to the binding function, a monad can implement a specific strategy for combining computations in the monad.
This will all become clearer after the example below, but if you feel particularly confused at this point you might try looking at this picture of monads before continuing.
An example
Suppose that we are writing a program to keep track of sheep cloning experiments. We would certainly want to know the genetic history of all of our sheep, so we would need mother
and father
functions. But since these are cloned sheep, they may not always have both a mother and a father!
We would represent the possibility of not having a mother or father using the Maybe
type constructor in our Haskell code:
type Sheep = ...
father :: Sheep > Maybe Sheep
father = ...
mother :: Sheep > Maybe Sheep
mother = ...
Then, defining functions to find grandparents is a little more complicated, because we have to handle the possibility of not having a parent:
maternalGrandfather :: Sheep > Maybe Sheep
maternalGrandfather s = case (mother s) of
Nothing > Nothing
Just m > father m
and so on for the other grandparent combinations.
It gets even worse if we want to find great grandparents:
mothersPaternalGrandfather :: Sheep > Maybe Sheep
mothersPaternalGrandfather s = case (mother s) of
Nothing > Nothing
Just m > case (father m) of
Nothing > Nothing
Just gf > father gf
Aside from being ugly, unclear, and difficult to maintain, this is just too much work. It is clear that a Nothing
value at any point in the computation will cause Nothing
to be the final result, and it would be much nicer to implement this notion once in a single place and remove all of the explicit case
testing scattered all over the code. This will make the code easier to write, easier to read and easier to change. So good programming style would have us create a combinator that captures the behavior we want:
Example 1
 comb is a combinator for sequencing operations that return Maybe
comb :: Maybe a > (a > Maybe b) > Maybe b
comb Nothing _ = Nothing
comb (Just x) f = f x
 now we can use `comb` to build complicated sequences
mothersPaternalGrandfather :: Sheep > Maybe Sheep
mothersPaternalGrandfather s = (Just s) `comb` mother `comb` father `comb` father
The combinator is a huge success! The code is much cleaner and easier to write, understand and modify. Notice also that the comb
function is entirely polymorphic — it is not specialized for Sheep
in any way. In fact, the combinator captures a general strategy for combining computations that may fail to return a value. Thus, we can apply the same combinator to other computations that may fail to return a value, such as database queries or dictionary lookups.
The happy outcome is that common sense programming practice has led us to create a monad without even realizing it. The Maybe
type constructor along with the Just
function (acts like return
) and our combinator (acts like >>=
) together form a simple monad for building computations which may not return a value. All that remains to make this monad truly useful is to make it conform to the monad framework built into the Haskell language. That is the subject of the next chapter.
List is also a monad
We have seen that the Maybe
type constructor is a monad for building computations which may fail to return a value. You may be surprised to know that another common Haskell type constructor, []
(for building lists), is also a monad. The List monad allows us to build computations which can return 0, 1, or more values.
The return
function for lists simply creates a singleton list (return x = [x]
). The binding operation for lists creates a new list containing the results of applying the function to all of the values in the original list (l >>= f = concatMap f l
).
One use of functions which return lists is to represent ambiguous computations — that is computations which may have 0, 1, or more allowed outcomes. In a computation composed from ambigous subcomputations, the ambiguity may compound, or it may eventually resolve into a single allowed outcome or no allowed outcome at all. During this process, the set of possible computational states is represented as a list. The List monad thus embodies a strategy for performing simultaneous computations along all allowed paths of an ambiguous computation.
Examples of this use of the List monad, and contrasting examples using the Maybe monad will be presented shortly. But first, we must see how useful monads are defined in Haskell.
Summary
We have seen that a monad is a type constructor, a function called return
, and a combinator function called bind
or >>=
. These three elements work together to encapsulate a strategy for combining computations to produce more complex computations.
Using the Maybe
type constructor, we saw how good programming practice led us to define a simple monad that could be used to build complex computations out of sequences of computations that could each fail to return a value. The resulting Maybe
monad encapsulates a strategy for combining computations that may not return values. By codifying the strategy in a monad, we have achieved a degree of modularity and flexibility that is not present when the computations are combined in an ad hoc manner.
We have also seen that another common Haskell type constructor, []
, is a monad. The List monad encapsulates a strategy for combining computations that can return 0, 1, or multiple values.
Doing it with class
Haskell type classes
The discussion in this chapter involves the Haskell type class system. If you are not familiar with type classes in Haskell, you should review them before continuing.
The Monad class
In Haskell, there is a standard Monad
class that defines the names and signatures of the two monad functions return
and >>=
. It is not strictly necessary to make your monads instances of the Monad
class, but it is a good idea. Haskell has special support for Monad
instances built into the language and making your monads instances of the Monad
class will allow you to use these features to write cleaner and more elegant code. Also, making your monads instances of the Monad
class communicates important information to others who read the code and failing to do so can cause you to use confusing and nonstandard function names. It's easy to do and it has many benefits, so just do it!
The standard Monad
class definition in Haskell looks something like this:
class Monad m where
(>>=) :: m a > (a > m b) > m b
return :: a > m a
Example continued
Continuing the previous example, we will now see how the Maybe
type constructor fits into the Haskell monad framework as an instance of the Monad
class.
Recall that our Maybe
monad used the Just
data constructor to fill the role of the monad return
function and we built a simple combinator to fill the role of the monad >>=
binding function. We can make its role as a monad explicit by declaring Maybe
as an instance of the Monad
class:
instance Monad Maybe where
Nothing >>= f = Nothing
(Just x) >>= f = f x
return = Just
Once we have defined Maybe
as an instance of the Monad class, we can use the standard monad operators to build the complex computations:
 we can use monadic operations to build complicated sequences
maternalGrandfather :: Sheep > Maybe Sheep
maternalGrandfather s = (return s) >>= mother >>= father
fathersMaternalGrandmother :: Sheep > Maybe Sheep
fathersMaternalGrandmother s = (return s) >>= father >>= mother >>= mother
In Haskell, Maybe
is defined as an instance of the Monad
class in the standard prelude, so you don't need to do it yourself. The other monad we have seen so far, the list constructor, is also defined as an instance of the Monad
class in the standard prelude.
File:Info.png When writing functions that work with monads, try to make use of the Monad
class instead of using a specific monad instance. A function of the type
doSomething :: (Monad m) ==> a > m b
is much more flexible than one of the type
doSomething :: a > Maybe b
The former function can be used with many types of monads to get different behavior depending on the strategy embodied in the monad, whereas the latter function is restricted to the strategy of the Maybe
monad.
Do notation
Using the standard monadic function names is good, but another advantage of membership in the Monad
class is the Haskell support for "do" notation. Do notation is an expressive shorthand for building up monadic computations, similar to the way that list comprehensions are an expressive shorthand for building computations on lists. Any instance of the Monad
class can be used in a doblock in Haskell.
In short, the do notation allows you to write monadic computations using a pseudoimperative style with named variables. The result of a monadic computation can be "assigned" to a variable using a left arrow <
operator. Then using that variable in a subsequent monadic computation automatically performs the binding. The type of the expression to the right of the arrow is a monadic type m a
. The expression to the left of the arrow is a pattern to be matched against the value inside the monad. (x:xs)
would match against Maybe [1,2,3]
, for example.
Here is a sample of do notation using the Maybe
monad:
Example 2
 we can also use donotation to build complicated sequences
mothersPaternalGrandfather :: Sheep > Maybe Sheep
mothersPaternalGrandfather s = do m < mother s
gf < father m
father gf
Compare this to fathersMaternalGrandmother
written above without using do notation.
The do block shown above is written using the layout rule to define the extent of the block. Haskell also allows you to use braces and semicolons when defining a do block:
mothersPaternalGrandfather s = do { m < mother s; gf < father m; father gf }
Notice that do notation resembles an imperative programming language, in which a computation is built up from an explicit sequence of simpler computations. In this respect, monads offer the possibility to create imperativestyle computations within a larger functional program. This theme will be expanded upon when we deal with sideeffects and the I/O monad later.
Do notation is simply syntactic sugar. There is nothing that can be done using do notation that cannot be done using only the standard monadic operators. But do notation is cleaner and more convenient in some cases, especially when the sequence of monadic computations is long. You should understand both the standard monadic binding notation and do notation and be able to apply each where they are appropriate.
The actual translation from do notation to standard monadic operators is roughly that every expression matched to a pattern, x < expr1
, becomes
expr1 >>= \x >
and every expression without a variable assignment, expr2
becomes
expr2 >>= \_ >
All do blocks must end with a monadic expression, and a let clause is allowed at the beginning of a do block (but let clauses in do blocks do not use the "in" keyword). The definition of mothersPaternalGrandfather
above would be translated to:
mothersPaternalGrandfather s = mother s >>= (\m >
father m >>= (\gf >
father gf))
(The parentheses are for clarity and aren't actually required.)
It now becomes clear why the binding operator is so named. It is literally used to bind the value in the monad to the argument in the following lambda expression.
Summary
Haskell provides builtin support for monads. To take advantage of Haskell's monad support, you must declare the monad type constructor to be an instance of the Monad
class and supply definitions of the return
and >>=
(pronounced "bind") functions for the monad.
A monad that is an instance of the Monad
class can be used with donotation, which is syntactic sugar that provides a simple, imperativestyle notation for describing computations with monads.
The monad laws
The tutorial up to now has avoided technical discussions, but there are a few technical points that must be made concerning monads. Monadic operations must obey a set of laws, known as "the monad axioms". These laws aren't enforced by the Haskell compiler, so it is up to the programmer to ensure that any Monad
instances they declare obey the laws. Haskell's Monad
class also includes some functions beyond the minimal complete definition that we have not seen yet. Finally, many monads obey additional laws beyond the standard monad laws, and there is an additional Haskell class to support these extended monads.
The three fundamental laws
The concept of a monad comes from a branch of mathematics called category theory. While it is not necessary to know category theory to create and use monads, we do need to obey a small bit of mathematical formalism. To create a monad, it is not enough just to declare a Haskell instance of the Monad
class with the correct type signatures. To be a proper monad, the return
and >>=
functions must work together according to three laws:
(return x) >>= f ==== f x
m >>= return ==== m
(m >>= f) >>= g ==== m >>= (\x > f x >>= g)
The first law requires that return
is a leftidentity with respect to >>=
. The second law requires that return
is a rightidentity with respect to >>=
. The third law is a kind of associativity law for >>=
. Obeying the three laws ensures that the semantics of the donotation using the monad will be consistent.
Any type constructor with return and bind operators that satisfy the three monad laws is a monad. In Haskell, the compiler does not check that the laws hold for every instance of the Monad
class. It is up to the programmer to ensure that any Monad
instance they create satisfies the monad laws.
Failure IS an option
The definition of the Monad
class given earlier showed only the minimal complete definition. The full definition of the Monad
class actually includes two additional functions: fail
and >>
.
The default implementation of the fail
function is:
fail s = error s
You do not need to change this for your monad unless you want to provide different behavior for failure or to incorporate failure into the computational strategy of your monad. The Maybe
monad, for instance, defines fail
as:
fail _ = Nothing
so that fail
returns an instance of the Maybe
monad with meaningful behavior when it is bound with other functions in the Maybe
monad.
The fail
function is not a required part of the mathematical definition of a monad, but it is included in the standard Monad
class definition because of the role it plays in Haskell's do notation. The fail
function is called whenever a pattern matching failure occurs in a do block:
fn :: Int > Maybe [Int]
fn idx = do let l = [Just [1,2,3], Nothing, Just [], Just [7..20]]
(x:xs) < l!!idx  a pattern match failure will call "fail"
return xs
So in the code above, fn 0
has the value Just [2,3]
, but fn 1
and fn 2
both have the value Nothing
.
The >>
function is a convenience operator that is used to bind a monadic computation that does not require input from the previous computation in the sequence. It is defined in terms of >>=
:
(>>) :: m a > m b > m b
m >> k = m >>= (\_ > k)
No way out
You might have noticed that there is no way to get values out of a monad as defined in the standard Monad
class. That is not an accident. Nothing prevents the monad author from allowing it using functions specific to the monad. For instance, values can be extracted from the Maybe
monad by pattern matching on Just x
or using the fromJust
function.
By not requiring such a function, the Haskell Monad
class allows the creation of oneway monads. Oneway monads allow values to enter the monad through the return
function (and sometimes the fail
function) and they allow computations to be performed within the monad using the bind functions >>=
and >>
, but they do not allow values back out of the monad.
The IO
monad is a familiar example of a oneway monad in Haskell. Because you can't escape from the IO
monad, it is impossible to write a function that does a computation in the IO
monad but whose result type does not include the IO
type constructor. This means that any function whose result type does not contain the IO
type constructor is guaranteed not to use the IO
monad. Other monads, such as List
and Maybe
, do allow values out of the monad. So it is possible to write functions which use these monads internally but return nonmonadic values.
The wonderful feature of a oneway monad is that it can support sideeffects in its monadic operations but prevent them from destroying the functional properties of the nonmonadic portions of the program.
Consider the simple issue of reading a character from the user. We cannot simply have a function readChar :: Char
, because it needs to return a different character each time it is called, depending on the input from the user. It is an essential property of Haskell as a pure functional language that all functions return the same value when called twice with the same arguments. But it is ok to have an I/O function getChar :: IO Char
in the IO
monad, because it can only be used in a sequence within the oneway monad. There is no way to get rid of the IO
type constructor in the signature of any function that uses it, so the IO
type constructor acts as a kind of tag that identifies all functions that do I/O. Furthermore, such functions are only useful within the IO
monad. So a oneway monad effectively creates an isolated computational domain in which the rules of a pure functional language can be relaxed. Functional computations can move into the domain, but dangerous sideeffects and nonreferentiallytransparent functions cannot escape from it.
Another common pattern when defining monads is to represent monadic values as functions. Then when the value of a monadic computation is required, the resulting monad is "run" to provide the answer.
Zero and Plus
Beyond the three monad laws stated above, some monads obey additional laws. These monads have a special value mzero
and an operator mplus
that obey four additional laws:
mzero >>= f == mzero
m >>= (\x > mzero) == mzero
mzero `mplus` m == m
m `mplus` mzero == m
It is easy to remember the laws for mzero
and mplus
if you associate mzero
with 0, mplus
with +, and >>=
with × in ordinary arithmetic.
Monads which have a zero and a plus can be declared as instances of the MonadPlus
class in Haskell:
class (Monad m) ==> MonadPlus m where
mzero :: m a
mplus :: m a > m a > m a
Continuing to use the Maybe
monad as an example, we see that the Maybe
monad is an instance of MonadPlus
:
instance MonadPlus Maybe where
mzero = Nothing
Nothing `mplus` x = x
x `mplus` _ = x
This identifies Nothing
as the zero value and says that adding two Maybe
values together gives the first value that is not Nothing
. If both input values are Nothing
, then the result of mplus
is also Nothing
.
The List monad also has a zero and a plus. mzero
is the empty list and mplus
is the ++
operator.
The mplus
operator is used to combine monadic values from separate computations into a single monadic value. Within the context of our sheepcloning example, we could use Maybe
's mplus
to define a function, parent s = (mother s) `mplus` (father s)
, which would return a parent if there is one, and Nothing
is the sheep has no parents at all. For a sheep with both parents, the function would return one or the other, depending on the exact definition of mplus
in the Maybe
monad.
Summary
Instances of the Monad
class should conform to the socalled monad laws, which describe algebraic properties of monads. There are three of these laws which state that the return
function is both a left and a right identity and that the binding operator is associative. Failure to satisfy these laws will result in monads that do not behave properly and may cause subtle problems when using donotation.
In addition to the return
and >>=
functions, the Monad
class defines another function, fail
. The fail
function is not a technical requirement for inclusion as a monad, but it is often useful in practice and it is included in the Monad
class because it is used in Haskell's donotation.
Some monads obey laws beyond the three basic monad laws. An important class of such monads are ones which have a notion of a zero element and a plus operator. Haskell provides a MonadPlus
class for such monads which define the mzero
value and the mplus
operator.
Exercises
This section contains a few simple exercises to hone the reader's monadic reasoning skills and to provide a solid comprehension of the function and use of the Maybe and List monads before looking at monadic programming in more depth. The exercises will build on the previous sheepcloning [[../examples/example2.hsexample]], with which the reader should already be familiar.
Exercise 1: Do notation
Rewrite the maternalGrandfather
, fathersMaternalGrandmother
, and mothersPaternalGrandfather
functions in [[../examples/example2.hsExample 2]] using the monadic operators return
and >>=
, without using any donotation syntactic sugar.
Click here to see the solution.
Exercise 2: Combining monadic values
Write functions parent
and grandparent
with signature Sheep > Maybe Sheep
. They should return one sheep selected from all sheep matching the description, or Nothing
if there is no such sheep. Hint: the mplus
operator is useful here.
Click here to see the solution.
Exercise 3: Using the List monad
Write functions parent
and grandparent
with signature Sheep > [Sheep]
. They should return all sheep matching the description, or the empty list if there is no such sheep. Hint: the mplus
operator in the List monad is useful here. Also the maybeToList
function in the Maybe
module can be used to convert a value from the Maybe monad to the List monad.
Click here to see the solution.
Exercise 4: Using the Monad class constraint
Monads promote modularity and code reuse by encapsulating oftenused computational strategies into single blocks of code that can be used to construct many different computations. Less obviously, monads also promote modularity by allowing you to vary the monad in which a computation is done to achieve different variations of the computation. This is achieved by writing functions which are polymorphic in the monad type constructor, using the (Monad m) ==>
, (MonadPlus m) ==>
, etc. class constraints.
Write functions parent
and grandparent
with signature (MonadPlus m) ==> Sheep > m Sheep
. They should be useful in both the Maybe and List monads. How does the functions' behavior differ when used with the List monad versus the Maybe monad? If you need to review the use of type classes and class constraints in Haskell, look here.
Click here to see the solution.
Monad support in Haskell
Haskell's built in support for monads is split among the standard prelude, which exports the most common monad functions, and the Monad module, which contains lesscommonly used monad functions. The individual monad types are each in their own libraries and are the subject of Part II of this tutorial.
In the standard prelude
The Haskell 2010 standard prelude includes the definition of the Monad
class as well as a few auxilliary functions for working with monadic data types.
The Monad
class
We have seen the Monad
class before:
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
 Minimal complete definition:
 (>>=), return
m >> k = m >>= \_ > k
fail s = error s
The sequencing functions
The sequence
function takes a list of monadic computations, executes each one in turn and returns a list of the results. If any of the computations fail, then the whole function fails:
sequence :: Monad m ==> [m a] > m [a]
sequence = foldr mcons (return [])
where mcons p q = p >>= \x > q >>= \y > return (x:y)
The sequence_
function (notice the underscore) has the same behavior as sequence
but does not return a list of results. It is useful when only the sideeffects of the monadic computations are important.
sequence_ :: Monad m ==> [m a] > m ()
sequence_ = foldr (>>) (return ())
The mapping functions
The mapM
function maps a monadic computation over a list of values and returns a list of the results. It is defined in terms of the list map
function and the sequence
function above:
mapM :: Monad m ==> (a > m b) > [a] > m [b]
mapM f as = sequence (map f as)
There is also a version with an underscore, mapM_
which is defined using sequence_. mapM_
operates the same as mapM
, but it doesn't return the list of values. It is useful when only the sideeffects of the monadic computation are important.
mapM_ :: Monad m ==> (a > m b) > [a] > m ()
mapM_ f as = sequence_ (map f as)
As a simple example of the use the mapping functions, a putString
function for the IO
monad could be defined as:
putString :: [Char] > IO ()
putString s = mapM_ putChar s
mapM
can be used within a do block in a manner similar to the way the map
function is normally used on lists. This is a common pattern with monads — a version of a function for use within a monad (i.e., intended for binding) will have a signature similar to the nonmonadic version but the function outputs will be within the monad:
 compare the nonmonadic and monadic signatures
map :: (a > b) > [a] > [b]
mapM :: Monad m ==> (a > m b) > [a] > m [b]
The reverse binder function (=<<
)
The prelude also defines a binding function that takes it arguments in the opposite order to the standard binding function. Since the standard binding function is called ">>=
", the reverse binding function is called "=<<
". It is useful in circumstances where the binding operator is used as a higherorder term and it is more convenient to have the arguments in the reversed order. Its definition is simply:
(=<<) :: Monad m ==> (a > m b) > m a > m b
f =<< x = x >>= f
In the Monad module
The Monad
module in the standard Haskell 2010 libraries exports a number of facilities for more advanced monadic operations. To access these facilities, simply import Monad
in your Haskell program.
Not all of the function in the Monad
module are discussed here, but you are encouraged to explore the module for yourself when you feel you are ready to see some of the more esoteric monad functions.
The MonadPlus
class
The Monad
module defines the MonadPlus
class for monads with a zero element and a plus operator:
class Monad m ==> MonadPlus m where
mzero :: m a
mplus :: m a > m a > m a
Monadic versions of list functions
Several functions are provided which generalize standard listprocessing functions to monads. The mapM
functions are exported in the standard prelude and were described above.
foldM
is a monadic version of foldl
in which monadic computations built from a list are bound lefttoright. The definition is:
foldM :: (Monad m) ==> (a > b > m a) > a > [b] > m a
foldM f a [] = return a
foldM f a (x:xs) = f a x >>= \y > foldM f y xs
but it is easier to understand the operation of foldM
if you consider its effect in terms of a do block:
 this is not valid Haskell code, it is just for illustration
foldM f a1 [x1,x2,...,xn] = do a2 < f a1 x1
a3 < f a2 x2
...
f an xn
Righttoleft binding is achieved by reversing the input list before calling foldM
.
We can use foldM
to create a more poweful query function in our sheep cloning example:
Example 3
 traceFamily is a generic function to find an ancestor
traceFamily :: Sheep > [ (Sheep > Maybe Sheep) ] > Maybe Sheep
traceFamily s l = foldM getParent s l
where getParent s f = f s
 we can define complex queries using traceFamily in an easy, clear way
mothersPaternalGrandfather s = traceFamily s [mother, father, father]
paternalGrandmother s = traceFamily s [father, mother]
The traceFamily
function uses foldM
to create a simple way to trace back in the family tree to any depth and in any pattern. In fact, it is probably clearer to write "traceFamily s [father, mother]
" than it is to use the paternalGrandmother
function!
A more typical use of foldM
is within a do block:
Example 4
 a Dict is just a finite map from strings to strings
type Dict = FiniteMap String String
 this an auxilliary function used with foldl
addEntry :: Dict > Entry > Dict
addEntry d e = addToFM d (key e) (value e)
 this is an auxiliiary function used with foldM inside the IO monad
addDataFromFile :: Dict > Handle > IO Dict
addDataFromFile dict hdl = do contents < hGetContents hdl
entries < return (map read (lines contents))
return (foldl (addEntry) dict entries)
 this program builds a dictionary from the entries in all files named on the
 command line and then prints it out as an association list
main :: IO ()
main = do files < getArgs
handles < mapM openForReading files
dict < foldM addDataFromFile emptyFM handles
print (fmToList dict)
The filterM
function works like the list filter
function inside of a monad. It takes a predicate function which returns a Boolean value in the monad and a list of values. It returns, inside the monad, a list of those values for which the predicate was True.
filterM :: Monad m ==> (a > m Bool) > [a] > m [a]
filterM p [] = return []
filterM p (x:xs) = do b < p x
ys < filterM p xs
return (if b then (x:ys) else ys)
Here is an example showing how filterM
can be used within the IO
monad to select only the directories from a list:
Example 5
import Monad
import Directory
import System
 NOTE: doesDirectoryExist has type FilePath > IO Bool
 this program prints only the directories named on the command line
main :: IO ()
main = do names < getArgs
dirs < filterM doesDirectoryExist names
mapM_ putStrLn dirs
zipWithM
is a monadic version of the zipWith
function on lists. zipWithM_
behaves the same but discards the output of the function. It is useful when only the sideeffects of the monadic computation matter.
zipWithM ::(Monad m) ==> (a > b > m c) > [a] > [b] > m [c]
zipWithM f xs ys = sequence (zipWith f xs ys)
zipWithM_ ::(Monad m) ==> (a > b > m c) > [a] > [b] > m ()
zipWithM_ f xs ys = sequence_ (zipWith f xs ys)
Conditional monadic computations
There are two functions provided for conditionally executing monadic computations. The when
function takes a boolean argument and a monadic computation with unit "()" type and performs the computation only when the boolean argument is True
. The unless
function does the same, except that it performs the computation unless the boolean argument is True
.
when :: (Monad m) ==> Bool > m () > m ()
when p s = if p then s else return ()
unless :: (Monad m) ==> Bool > m () > m ()
unless p s = when (not p) s
ap
and the lifting functions
Lifting is a monadic operation that converts a nonmonadic function into an equivalent function that operates on monadic values. We say that a function is "lifted into the monad" by the lifting operators. A lifted function is useful for operating on monad values outside of a do block and can also allow for cleaner code within a do block.
The simplest lifting operator is liftM
, which lifts a function of a single argument into a monad.
liftM :: (Monad m) ==> (a > b) > (m a > m b)
liftM f = \a > do { a' < a; return (f a') }
Lifting operators are also provided for functions with more arguments. liftM2
lifts functions of two arguments:
liftM2 :: (Monad m) ==> (a > b > c) > (m a > m b > m c)
liftM2 f = \a b > do { a' < a; b' < b; return (f a' b') }
The same pattern is applied to give the definitions to lift functions of more arguments. Functions up to liftM5
are defined in the Monad
module.
To see how the lifting operators allow more concise code, consider a computation in the Maybe
monad in which you want to use a function swapNames::String > String
. You could do:
getName :: String > Maybe String
getName name = do let db = [("John", "Smith, John"), ("Mike", "Caine, Michael")]
tempName < lookup name db
return (swapNames tempName)
But making use of the liftM
function, we can use liftM swapNames
as a function of type Maybe String > Maybe String
:
Example 6
getName :: String > Maybe String
getName name = do let db = [("John", "Smith, John"), ("Mike", "Caine, Michael")]
liftM swapNames (lookup name db)
The difference is even greater when lifting functions with more arguments.
The lifting functions also enable very concise constructions using higherorder functions. To understand this example code, you might need to review the definition of the monad functions for the List monad (particularly >>=
). Imagine how you might implement this function without lifting the operator:
Example 7
 allCombinations returns a list containing the result of
 folding the binary operator through all combinations
 of elements of the given lists
 For example, allCombinations (+) [[0,1],[1,2,3]] would be
 [0+1,0+2,0+3,1+1,1+2,1+3], or [1,2,3,2,3,4]
 and allCombinations (*) [[0,1],[1,2],[3,5]] would be
 [0*1*3,0*1*5,0*2*3,0*2*5,1*1*3,1*1*5,1*2*3,1*2*5], or [0,0,0,0,3,5,6,10]
allCombinations :: (a > a > a) > [[a]] > [a]
allCombinations fn [] = []
allCombinations fn (l:ls) = foldl (liftM2 fn) l ls
There is a related function called ap
that is sometimes more convenient to use than the lifting functions. ap
is simply the function application operator ($
) lifted into the monad:
ap :: (Monad m) ==> m (a > b) > m a > m b
ap = liftM2 ($)
Note that liftM2 f x y
is equivalent to return f `ap` x `ap` y
, and so on for functions of more arguments. ap
is useful when working with higherorder functions and monads.
The effect of ap
depends on the strategy of the monad in which it is used. So for example [(*2),(+3)] `ap` [0,1,2]
is equal to [0,2,4,3,4,5]
and (Just (*2)) `ap` (Just 3)
is Just 6
. Here is a simple example that shows how ap
can be useful when doing higherorder computations:
Example 8
 lookup the commands and fold ap into the command list to
 compute a result.
main :: IO ()
main = do let fns = [("double",(2*)), ("halve",(`div`2)),
("square",(\x>x*x)), ("negate", negate),
("incr",(+1)), ("decr",(+(1)))
]
args < getArgs
let val = read (args!!0)
cmds = map ((flip lookup) fns) (words (args!!1))
print $ foldl (flip ap) (Just val) cmds
Functions for use with MonadPlus
There are two functions in the Monad
module that are used with monads that have a zero and a plus. The first function is msum
, which is analogous to the sum
function on lists of integers. msum
operates on lists of monadic values and folds the mplus
operator into the list using the mzero
element as the initial value:
msum :: MonadPlus m ==> [m a] > m a
msum xs = foldr mplus mzero xs
In the List monad, msum
is equivalent to concat
. In the Maybe
monad, msum
returns the first nonNothing
value from a list. Likewise, the behavior in other monads will depend on the exact nature of their mzero
and mplus
definitions.
msum
allows many recursive functions and folds to be expressed more concisely. In the Maybe
monad, for example, we can write:
Example 9
type Variable = String
type Value = String
type EnvironmentStack = [[(Variable,Value)]]
 lookupVar retrieves a variable's value from the environment stack
 It uses msum in the Maybe monad to return the first nonNothing value.
lookupVar :: Variable > EnvironmentStack > Maybe Value
lookupVar var stack = msum $ map (lookup var) stack
instead of:
lookupVar :: Variable > EnvironmentStack > Maybe Value
lookupVar var [] = Nothing
lookupVar var (e:es) = let val = lookup var e
in maybe (lookupVar var es) Just val
The second function for use with monads with a zero and a plus is the guard
function:
guard :: MonadPlus m ==> Bool > m ()
guard p = if p then return () else mzero
The trick to understanding this function is to recall the law for monads with zero and plus that states mzero >>= f ==== mzero
. So, placing a guard
function in a sequence of monadic operations will force any execution in which the guard is False
to be mzero
. This is similar to the way that guard predicates in a list comprehension cause values that fail the predicate to become []
.
Here is an example demonstrating the use of the guard
function in the Maybe
monad.
Example 10
data Record = Rec {name::String, age::Int} deriving Show
type DB = [Record]
 getYoungerThan returns all records for people younger than a specified age.
 It uses the guard function to eliminate records for ages at or over the limit.
 This is just for demonstration purposes. In real life, it would be
 clearer to simply use filter. When the filter criteria are more complex,
 guard becomes more useful.
getYoungerThan :: Int > DB > [Record]
getYoungerThan limit db = mapMaybe (\r > do { guard (age r < limit); return r }) db
Summary
Haskell provides a number of functions which are useful for working with monads in the standard libraries. The Monad
class and most common monad functions are in the standard prelude. The MonadPlus
class and less commonlyused (but still very useful!) functions are defined in the Monad
module. Many other types in the Haskell libraries are declared as instances of Monad
and MonadPlus
in their respective modules.
A Catalog of Standard Monads
Introduction
The monads covered in Part II include a mixture of standard Haskell types that are monads as well as monad classes from Andy Gill's Monad Template Library. The Monad Template Library is included in the Glasgow Haskell Compiler's hierarchical libraries under Control.Monad
Some of the documentation for these monads comes from the excellent Haskell Wiki. In addition to the monads covered here, monads appear many other places in Haskell, such as the Parsec monadic combinator parsing library. These monads are beyond the scope of this reference, but they are thoroughly documented on their own. You can get a taste of the Parsec library by looking in the [[../examples/example16.hssource code]] for example 16.
Monad  Type of computation  Combination strategy for >>= 

Identity  N/A — Used with monad transformers  The bound function is applied to the input value. 
Maybe  Computations which may not return a result  Nothing input gives Nothing outputJust x input uses x as input to the bound function.

Error  Computations which can fail or throw exceptions  Failure records information describing the failure. Binding passes failure information on without executing the bound function, or uses successful values as input to the bound function. 
[] (List)  Nondeterministic computations which can return multiple possible results  Maps the bound function onto the input list and concatenates the resulting lists to get a list of all possible results from all possible inputs. 
IO  Computations which perform I/O  Sequential execution of I/O actions in the order of binding. 
State  Computations which maintain state  The bound function is applied to the input value to produce a state transition function which is applied to the input state. 
Reader  Computations which read from a shared environment  The bound function is applied to the value of the input using the same environment. 
Writer  Computations which write data in addition to computing values  Written data is maintained separately from values. The bound function is applied to the input value and anything it writes is appended to the write data stream. 
Cont  Computations which can be interrupted and restarted  The bound function is inserted into the continuation chain. 
The Identity monad
Overview
 Computation type: Simple function application
 Binding strategy: The bound function is applied to the input value.
Identity x >>= f ==== f x
 Useful for: Monads can be derived from monad transformers applied to the Identity monad.
 Zero and plus: None.
 Example type: Identity a
Motivation
The Identity monad is a monad that does not embody any computational strategy. It simply applies the bound function to its input without any modification. Computationally, there is no reason to use the Identity monad instead of the much simpler act of simply applying functions to their arguments. The purpose of the Identity monad is its fundamental role in the theory of monad transformers (covered in Part III). Any monad transformer applied to the Identity monad yields a nontransformer version of that monad.
Definition
newtype Identity a = Identity { runIdentity :: a }
instance Monad Identity where
return a = Identity a  i.e. return = id
(Identity x) >>= f = f x  i.e. x >>= f = f x
The runIdentity
label is used in the type definition because it follows a style of monad definition that explicitly represents monad values as computations. In this style, a monadic computation is built up using the monadic operators and then the value of the computation is extracted using the run******
function. Because the Identity monad does not do any computation, its definition is trivial. For a better example of this style of monad, see the State monad.
A typical use of the Identity monad is to derive a monad from a monad transformer.
 derive the State monad using the StateT monad transformer
type State s a = StateT s Identity a
The Maybe monad
Overview
 Computation type: Computations which may return
Nothing
 Binding strategy:
Nothing
values bypass the bound function, other values are used as inputs to the bound function.
 Useful for: Building computations from sequences of functions that may return
Nothing
. Complex database queries or dictionary lookups are good examples.
 Zero and plus:
Nothing
is the zero. The plus operation returns the first nonNothing
value orNothing
if both inputs areNothing
.
 Example type: Maybe a
Motivation
The Maybe monad embodies the strategy of combining a chain of computations that may each return Nothing
by ending the chain early if any step produces Nothing
as output. It is useful when a computation entails a sequence of steps that depend on one another, and in which some steps may fail to return a value.
File:Info.png If you ever find yourself writing code like this:
case ... of
Nothing > Nothing
Just x > case ... of
Nothing > Nothing
Just y > ...
you should consider using the monadic properties of Maybe
to improve the code.
Definition
data Maybe a = Nothing  Just a
instance Monad Maybe where
return = Just
fail = Nothing
Nothing >>= f = Nothing
(Just x) >>= f = f x
instance MonadPlus Maybe where
mzero = Nothing
Nothing `mplus` x = x
x `mplus` _ = x
A common example is in combining dictionary lookups. Given a dictionary that maps full names to email addresses, another that maps nicknames to email addresses, and a third that maps email addresses to email preferences, you could create a function that finds a person's email preferences based on either a full name or a nickname.
Example 11
data MailPref = HTML  Plain
data MailSystem = ...
getMailPrefs :: MailSystem > String > Maybe MailPref
getMailPrefs sys name ==
do let nameDB = fullNameDB sys
nickDB = nickNameDB sys
prefDB = prefsDB sys
addr < (lookup name nameDB) `mplus` (lookup name nickDB)
lookup addr prefDB
The Error monad
Overview
 Computation type: Computations which may fail or throw exceptions
 Binding strategy: Failure records information about the cause/location of the failure. Failure values bypass the bound function, other values are used as inputs to the bound function.
 Useful for: Building computations from sequences of functions that may fail or using exception handling to structure error handling.
 Zero and plus: Zero is represented by an empty error and the plus operation executes its second argument if the first fails.
 Example type: Either String a
Motivation
The Error monad (also called the Exception monad) embodies the strategy of combining computations that can throw exceptions by bypassing bound functions from the point an exception is thrown to the point that it is handled.
The MonadError
class is parameterized over the type of error information and the monad type constructor. It is common to use Either String
as the monad type constructor for an error monad in which error descriptions take the form of strings. In that case and many other common cases the resulting monad is already defined as an instance of the MonadError
class. You can also define your own error type and/or use a monad type constructor other than Either String
or Either IOError
. In these cases you will have to explicitly define instances of the Error
and/or MonadError
classes.
Definition
The definition of the MonadError
class below uses multiparameter type classes and funDeps, which are language extensions not found in standard Haskell 2010. You don't need to understand them to take advantage of the MonadError
class.
class Error a where
noMsg :: a
strMsg :: String > a
class (Monad m) ==> MonadError e m  m > e where
throwError :: e > m a
catchError :: m a > (e > m a) > m a
throwError
is used within a monadic computation to begin exception processing. catchError
provides a handler function to handle previous errors and return to normal execution. A common idiom is:
do { action1; action2; action3 } `catchError` handler
where the action
functions can call throwError
. Note that handler
and the doblock must have the same return type.
The definition of the Either e
type constructor as an instance of the MonadError
class is straightforward. Following convention, Left
is used for error values and Right
is used for nonerror (right) values.
instance MonadError (Either e) where
throwError = Left
(Left e) `catchError` handler = handler e
a `catchError` _ = a
Here is an example that demonstrates the use of a custom Error
data type with the ErrorMonad
's throwError
and catchError
exception mechanism. The example attempts to parse hexadecimal numbers and throws an exception if an invalid character is encountered. We use a custom Error
data type to record the location of the parse error. The exception is caught by a calling function and handled by printing an informative error message.
Example 12
 This is the type of our parse error representation.
data ParseError = Err {location::Int, reason::String}
 We make it an instance of the Error class
instance Error ParseError where
noMsg = Err 0 "Parse Error"
strMsg s = Err 0 s
 For our monad type constructor, we use Either ParseError
 which represents failure using Left ParseError or a
 successful result of type a using Right a.
type ParseMonad = Either ParseError
 parseHexDigit attempts to convert a single hex digit into
 an Integer in the ParseMonad monad and throws an error on an
 invalid character
parseHexDigit :: Char > Int > ParseMonad Integer
parseHexDigit c idx = if isHexDigit c then
return (toInteger (digitToInt c))
else
throwError (Err idx ("Invalid character '" ++ [c] ++ "'"))
 parseHex parses a string containing a hexadecimal number into
 an Integer in the ParseMonad monad. A parse error from parseHexDigit
 will cause an exceptional return from parseHex.
parseHex :: String > ParseMonad Integer
parseHex s = parseHex' s 0 1
where parseHex' [] val _ = return val
parseHex' (c:cs) val idx = do d < parseHexDigit c idx
parseHex' cs ((val * 16) + d) (idx + 1)
 toString converts an Integer into a String in the ParseMonad monad
toString :: Integer > ParseMonad String
toString n = return $ show n
 convert takes a String containing a hexadecimal representation of
 a number to a String containing a decimal representation of that
 number. A parse error on the input String will generate a
 descriptive error message as the output String.
convert :: String > String
convert s = let (Right str) = do {n < parseHex s; toString n} `catchError` printError
in str
where printError e = return $ "At index " ++ (show (location e)) ++ ":" ++ (reason e)
The List monad
Overview
 Computation type: Computations which may return 0, 1, or more possible results.
 Binding strategy: The bound function is applied to all possible values in the input list and the resulting lists are concatenated to produce a list of all possible results.
 Useful for: Building computations from sequences of nondeterministic operations. Parsing ambiguous grammars is a common example.
 Zero and plus:
[]
is the zero and++
is the plus operation.
 Example type:
[a]
Motivation
The List monad embodies the strategy of combining a chain of nondeterministic computations by applying the operations to all possible values at each step. It is useful when computations must deal with ambiguity. In that case it allows all possibilities to be explored until the ambiguity is resolved.
Definition
instance Monad [] where
m >>= f = concatMap f m
return x = [x]
fail s = []
instance MonadPlus [] where
mzero = []
mplus = (++)
The canonical example of using the List monad is for parsing ambiguous grammars. The example below shows just a small example of parsing data into hex values, decimal values and words containing only alphanumeric characters. Note that hexadecimal digits overlap both decimal digits and alphanumeric characters, leading to an ambiguous grammar. "dead" is both a valid hex value and a word, for example, and "10" is both a decimal value of 10 and a hex value of 16.
Example 13
 we can parse three different types of terms
data Parsed = Digit Integer  Hex Integer  Word String deriving Show
 attempts to add a character to the parsed representation of a hex digit
parseHexDigit :: Parsed > Char > [Parsed]
parseHexDigit (Hex n) c = if isHexDigit c then
return (Hex ((n*16) + (toInteger (digitToInt c))))
else
mzero
parseHexDigit _ _ = mzero
 attempts to add a character to the parsed representation of a decimal digit
parseDigit :: Parsed > Char > [Parsed]
parseDigit (Digit n) c = if isDigit c then
return (Digit ((n*10) + (toInteger (digitToInt c))))
else
mzero
parseDigit _ _ = mzero
 attempts to add a character to the parsed representation of a word
parseWord :: Parsed > Char > [Parsed]
parseWord (Word s) c = if isAlpha c then
return (Word (s ++ [c]))
else
mzero
parseWord _ _ = mzero
 tries to parse the digit as a hex value, a decimal value and a word
 the result is a list of possible parses
parse :: Parsed > Char > [Parsed]
parse p c = (parseHexDigit p c) `mplus` (parseDigit p c) `mplus` (parseWord p c)
 parse an entire String and return a list of the possible parsed values
parseArg :: String > [Parsed]
parseArg s = do init < (return (Hex 0)) `mplus` (return (Digit 0)) `mplus` (return (Word ""))
foldM parse init s
The IO monad
Overview
 Computation type: Computations which perform I/O
 Binding strategy: I/O actions are executed in the order in which they are bound. Failures throw I/O errors which can be caught and handled.
 Useful for: Performing I/O within a Haskell program.
 Zero and plus: None.
 Example type: IO a
Motivation
Input/Output is incompatible with a pure functional language because it is not referentially transparent and sideeffect free. The IO monad solves this problem by confining computations that perform I/O within the IO monad.
Definition
The definition of the IO monad is platformspecific. No data constructors are exported and no functions are provided to remove data from the IO monad. This makes the IO monad a oneway monad and is essential to ensuring safety of functional programs by isolating sideeffects and nonreferentially transparent actions within the imperativestyle computations of the IO monad.
Throughout this tutorial, we have referred to monadic values as computations. However, values in the IO monad are often called I/O actions and we will use that terminology here.
In Haskell, the toplevel main
function must have type IO ()
, so that programs are typically structured at the top level as an imperativestyle sequence of I/O actions and calls to functionalstyle code. The functions exported from the IO
module do not perform I/O themselves. They return I/O actions, which describe an I/O operation to be performed. The I/O actions are combined within the IO monad (in a purely functional manner) to create more complex I/O actions, resulting in the final I/O action that is the main
value of the program.
The standard prelude and the IO
module define many functions that can be used within the IO monad and any Haskell programmer will undoubtedly be familiar with some of them. This tutorial will only discuss the monadic aspects of the IO monad, not the full range of functions available to perform I/O.
The IO
type constructor is a member of the Monad
class and the MonadError
class, where errors are of the type IOError
. fail
is defined to throw an error built from the string argument. Within the IO
monad you can use the exception mechanisms from the Control.Monad.Error
module in the Monad Template Library if you import the module. The same mechanisms have alternative names exported by the IO
module: ioError
and catch
.
instance Monad IO where
return a = ...  function from a > IO a
m >>= k = ...  executes the I/O action m and binds the value to k's input
fail s = ioError (userError s)
data IOError = ...
ioError :: IOError > IO a
ioError = ...
userError :: String > IOError
userError = ...
catch :: IO a > (IOError > IO a) > IO a
catch = ...
try :: IO a > IO (Either IOError a)
try f = catch (do r < f
return (Right r))
(return . Left)
The IO
monad is incorporated into the Monad Template Library framework as an instance of the MonadError
class.
instance Error IOError where
...
instance MonadError IO where
throwError = ioError
catchError = catch
The IO
module exports a convenience function called try
that executes an I/O action and returns Right result
if the action succeeded or Left IOError
if an I/O error was caught.
This example shows a partial implementation of the "tr" command that copies the standard input stream to the standard output stream with character translations controlled by commandline arguments. It demonstrates the use of the exception handling mechanisms of the MonadError
class with the IO
monad.
Example 14
import Monad
import System
import IO
import Control.Monad.Error
 translate char in set1 to corresponding char in set2
translate :: String > String > Char > Char
translate [] _ c = c
translate (x:xs) [] c = if x == c then ' ' else translate xs [] c
translate (x:xs) [y] c = if x == c then y else translate xs [y] c
translate (x:xs) (y:ys) c = if x == c then y else translate xs ys c
 translate an entire string
translateString :: String > String > String > String
translateString set1 set2 str = map (translate set1 set2) str
usage :: IOError > IO ()
usage e = do putStrLn "Usage: ex14 set1 set2"
putStrLn "Translates characters in set1 on stdin to the corresponding"
putStrLn "characters from set2 and writes the translation to stdout."
 translates stdin to stdout based on commandline arguments
main :: IO ()
main = (do [set1,set2] < getArgs
contents < hGetContents stdin
putStr $ translateString set1 set2 contents)
`catchError` usage
The State monad
Overview
 Computation type: Computations which maintain state.
 Binding strategy: Binding threads a state parameter through the sequence of bound functions so that the same state value is never used twice, giving the illusion of inplace update.
 Useful for: Building computations from sequences of operations that require a shared state.
 Zero and plus: None.
 Example type: State st a
Motivation
A pure functional language cannot update values in place because it violates referential transparency. A common idiom to simulate such stateful computations is to "thread" a state parameter through a sequence of functions:
data MyType = MT Int Bool Char Int deriving Show
makeRandomValue :: StdGen > (MyType, StdGen)
makeRandomValue g = let (n,g1) = randomR (1,100) g
(b,g2) = random g1
(c,g3) = randomR ('a','z') g2
(m,g4) = randomR (n,n) g3
in (MT n b c m, g4)
This approach works, but such code can be errorprone, messy and difficult to maintain. The State monad hides the threading of the state parameter inside the binding operation, simultaneously making the code easier to write, easier to read and easier to modify.
Definition
The definition shown here uses multiparameter type classes and funDeps, which are not standard Haskell 2010. It is not necessary to fully understand these details to make use of the State monad.
newtype State s a = State { runState :: (s > (a,s)) }
instance Monad (State s) where
return a = State $ \s > (a,s)
(State x) >>= f = State $ \s > let (v,s') = x s in runState (f v) s'
Values in the State monad are represented as transition functions from an initial state to a (value,newState) pair and a new type definition is provided to describe this construct: State s a
is the type of a value of type a
inside the State monad with state of type s
.
The type constructor State s
is an instance of the Monad
class. The return
function simply creates a state transition function which sets the value but leaves the state unchanged. The binding operator creates a state transition function that applies its righthand argument to the value and new state from its lefthand argument.
class MonadState m s  m > s where
get :: m s
put :: s > m ()
instance MonadState (State s) s where
get = State $ \s > (s,s)
put s = State $ \_ > ((),s)
The MonadState
class provides a standard but very simple interface for State monads. The get
function retrieves the state by copying it as the value. The put
function sets the state of the monad and does not yield a value.
There are many additional functions provide which perform more complex computations built on top of get
and put. The most useful one is gets
which retrieves a function of the state. The others are listed in the documentation for the State monad library.
A simple application of the State monad is to thread the random generator state through multiple calls to the generation function.
Example 15
data MyType = MT Int Bool Char Int deriving Show
{ Using the State monad, we can define a function that returns
a random value and updates the random generator state at
the same time.
}
getAny :: (Random a) ==> State StdGen a
getAny = do g < get
(x,g') < return $ random g
put g'
return x
 similar to getAny, but it bounds the random value returned
getOne :: (Random a) ==> (a,a) > State StdGen a
getOne bounds = do g < get
(x,g') < return $ randomR bounds g
put g'
return x
{ Using the State monad with StdGen as the state, we can build
random complex types without manually threading the
random generator states through the code.
}
makeRandomValueST :: StdGen > (MyType, StdGen)
makeRandomValueST = runState (do n < getOne (1,100)
b < getAny
c < getOne ('a','z')
m < getOne (n,n)
return (MT n b c m))
The Reader monad
Overview
 Computation type: Computations which read values from a shared environment.
 Binding strategy: Monad values are functions from the environment to a value. The bound function is applied to the bound value, and both have access to the shared environment.
 Useful for: Maintaining variable bindings, or other shared environment.
 Zero and plus: None.
 Example type: Reader [(String,Value)] a
Motivation
Some programming problems require computations within a shared environment (such as a set of variable bindings). These computations typically read values from the environment and sometimes execute subcomputations in a modified environment (with new or shadowing bindings, for example), but they do not require the full generality of the State monad.
The Reader monad is specifically designed for these types of computations and is often a clearer and easier mechanism than using the State monad.
Definition
The definition shown here uses multiparameter type classes and funDeps, which are not standard Haskell 2010. It is not necessary to fully understand these details to make use of the Reader monad.
newtype Reader e a = Reader { runReader :: (e > a) }
instance Monad (Reader e) where
return a = Reader $ \e > a
(Reader r) >>= f = Reader $ \e > runReader (f (r e)) e
Values in the Reader monad are functions from an environment to a value. To extract the final value from a computation in the Reader monad, you simply apply (runReader reader)
to an environment value.
The return
function creates a Reader
that ignores the environment and produces the given value. The binding operator produces a Reader
that uses the environment to extract the value its lefthand side and then applies the bound function to that value in the same environment.
class MonadReader e m  m > e where
ask :: m e
local :: (e > e) > m a > m a
instance MonadReader e (Reader e) where
ask = Reader id
local f c = Reader $ \e > runReader c (f e)
asks :: (MonadReader e m) ==> (e > a) > m a
asks sel = ask >>= return . sel
The MonadReader
class provides a number of convenience functions that are very useful when working with a Reader monad. The ask
function retrieves the environment and the local
function executes a computation in a modified environment. The asks
function is a convenience function that retrieves a function of the current environment, and is typically used with a selector or lookup function.
Consider the problem of instantiating templates which contain variable substitutions and included templates. Using the Reader monad, we can maintain an environment of all known templates and all known variable bindings. Then, when a variable substitution is encountered, we can use the asks
function to lookup the value of the variable. When a template is included with new variable definitions, we can use the local
function to resolve the template in a modified environment that contains the additional variable bindings.
Example 16
 This the abstract syntax representation of a template
 Text Variable Quote Include Compound
data Template = T String  V Template  Q Template  I Template [Definition]  C [Template]
data Definition = D Template Template
 Our environment consists of an association list of named templates and
 an association list of named variable values.
data Environment = Env {templates::[(String,Template)],
variables::[(String,String)]}
 lookup a variable from the environment
lookupVar :: String > Environment > Maybe String
lookupVar name env = lookup name (variables env)
 lookup a template from the environment
lookupTemplate :: String > Environment > Maybe Template
lookupTemplate name env = lookup name (templates env)
 add a list of resolved definitions to the environment
addDefs :: [(String,String)] > Environment > Environment
addDefs defs env = env {variables = defs ++ (variables env)}
 resolve a Definition and produce a (name,value) pair
resolveDef :: Definition > Reader Environment (String,String)
resolveDef (D t d) = do name < resolve t
value < resolve d
return (name,value)
 resolve a template into a string
resolve :: Template > Reader Environment (String)
resolve (T s) = return s
resolve (V t) = do varName < resolve t
varValue < asks (lookupVar varName)
return $ maybe "" id varValue
resolve (Q t) = do tmplName < resolve t
body < asks (lookupTemplate tmplName)
return $ maybe "" show body
resolve (I t ds) = do tmplName < resolve t
body < asks (lookupTemplate tmplName)
case body of
Just t' > do defs < mapM resolveDef ds
local (addDefs defs) (resolve t')
Nothing > return ""
resolve (C ts) = (liftM concat) (mapM resolve ts)
To use the Reader monad to resolve a template t
into a String
, you simply need to do runReader (resolve t) env
.
The Writer monad
Overview
 Computation type: Computations which produce a stream of data in addition to the computed values.
 Binding strategy: A Writer monad value is a (computation value, log value) pair. Binding replaces the computation value with the result of applying the bound function to the previous value and appends any log data from the computation to the existing log data.
 Useful for: Logging, or other computations that produce output "on the side".
 Zero and plus: None.
 Example type: Writer [String] a
Motivation
It is often desirable for a computation to generate output "on the side". Logging and tracing are the most common examples in which data is generated during a computation that we want to retain but is not the primary result of the computation.
Explicitly managing the logging or tracing data can clutter up the code and invite subtle bugs such as missed log entries. The Writer monad provides a cleaner way to manage the output without cluttering the main computation.
Definition
The definition shown here uses multiparameter type classes and funDeps, which are not standard Haskell 2010. It is not necessary to fully understand these details to make use of the Writer monad.
File:Info.png To fully understand this definition, you need to know about Haskell's Monoid
class, which represents a mathematical structure called a monoid in the same way that the Monad
class represents the monad structure.
The good news is that monoids are simpler than monads. A monoid is a set of objects, a single identity element, and an associative binary operator over the set of objects. A monoid must obey some mathematical laws, such that applying the operator to any values from the set gives another value in the set, and whenever one operand of the operator is the identity element the result is equal to the other operand. You may notice that these laws are the same as the laws governing mzero
and mplus
for instances of MonadPlus
. That is because monads with a zero and plus are monads that are also monoids!
Some examples of mathematical monoids are the natural numbers with identity element 0 and binary operator for addition, and also the natural numbers with identity element 1 and binary operator for multiplication.
In Haskell, a monoid consists of a type, an identity element, and a binary operator. Haskell defines the Monoid
class (in Data.Monoid) to provide a standard convention for working with monoids: the identity element is named mempty
and the operator is named mappend
.
The most commonly used standard monoid in Haskell is the list, but functions of type (a > a)
also form a monoid.
File:Warn.png Care should be taken when using a list as the monoid for a Writer, as there may be a performance penalty associated with the mappend
operation as the output grows. In that case, a data structure that supports fast append operations would be a more appropriate choice.
newtype Writer w a = Writer { runWriter :: (a,w) }
instance (Monoid w) ==> Monad (Writer w) where
return a = Writer (a,mempty)
(Writer (a,w)) >>= f = let (a',w') = runWriter $ f a in Writer (a',w `mappend` w')
The Writer monad maintains a (value,log) pair, where the log type must be a monoid. The return
function simply returns the value along with an empty log. Binding executes the bound function using the current value as input, and appends any log output to the existing log.
class (Monoid w, Monad m) ==> MonadWriter w m  m > w where
pass :: m (a,w > w) > m a
listen :: m a > m (a,w)
tell :: w > m ()
instance (Monoid w) ==> MonadWriter w (Writer w) where
pass (Writer ((a,f),w)) = Writer (a,f w)
listen (Writer (a,w)) = Writer ((a,w),w)
tell s = Writer ((),s)
listens :: (MonadWriter w m) ==> (w > b) > m a > m (a,b)
listens f m = do (a,w) < listen m; return (a,f w)
censor :: (MonadWriter w m) ==> (w > w) > m a > m a
censor f m = pass $ do a < m; return (a,f)
The MonadWriter
class provides a number of convenience functions for working with Writer monads. The simplest and most useful is tell
, which adds one or more entries to the log. The listen
function turns a Writer that returns a value a
and produces output w
into a Writer that produces a value (a,w)
and still produces output w
. This allows the computation to "listen" to the log output generated by a Writer.
The pass
function is slightly more complicated. It converts a Writer that produces a value (a,f)
and output w
into a Writer that produces a value a
and output f w
. This is somewhat cumbersome, so the helper function censor
is normally used. The censor
function takes a function and a Writer and produces a new Writer whose output is the same but whose log entry has been modified by the function.
The listens
function operates just like listen
except that the log part of the value is modified by the supplied function.
In this example, we imagine a very simple firewall that filters packets based on a rulebase of rules matching the source and destination hosts and the payload of the packet. The firewall's primary job is packet filtering, but we would also like it to produce a log of its activity.
Example 17
 this is the format of our log entries
data Entry = Log {count::Int, msg::String} deriving Eq
 add a message to the log
logMsg :: String > Writer [Entry] ()
logMsg s = tell [Log 1 s]
 this handles one packet
filterOne :: [Rule] > Packet > Writer [Entry] (Maybe Packet)
filterOne rules packet = do
rule < return (match rules packet)
case rule of
Nothing > do
logMsg $ "DROPPING UNMATCHED PACKET: " ++ (show packet)
return Nothing
(Just r) > do
when (logIt r) $ logMsg ("MATCH: " ++ (show r) ++ " <=> " ++ (show packet))
case r of (Rule Accept _ _) > return $ Just packet
(Rule Reject _ _) > return Nothing
That was pretty simple, but what if we want to merge duplicate consecutive log entries? None of the existing functions allow us to modify the output from previous stages of the computation, but we can use a "delayed logging" trick to only add a log entry only after we get a new entry that doesn't match the ones before it.
 merge identical entries at the end of the log
 This function uses [Entry] as both the log type and the result type.
 When two identical messages are merged, the result is just the message
 with an incremented count. When two different messages are merged,
 the first message is logged and the second is returned as the result.
mergeEntries :: [Entry] > [Entry] > Writer [Entry] [Entry]
mergeEntries [] x = return x
mergeEntries x [] = return x
mergeEntries [e1] [e2] = let (Log n msg) = e1
(Log n' msg') = e2
in if msg == msg' then
return [(Log (n+n') msg)]
else
do tell [e1]
return [e2]
 This is a complexlooking function but it is actually pretty simple.
 It maps a function over a list of values to get a list of Writers,
 then runs each writer and combines the results. The result of the function
 is a writer whose value is a list of all the values from the writers and whose
 log output is the result of folding the merge operator into the individual
 log entries (using 'initial' as the initial log value).
groupSame :: (Monoid a) ==> a > (a > a > Writer a a) > [b] > (b > Writer a c) > Writer a [c]
groupSame initial merge [] _ = do tell initial
return []
groupSame initial merge (x:xs) fn = do (result,output) < return (runWriter (fn x))
new < merge initial output
rest < groupSame new merge xs fn
return (result:rest)
 this filters a list of packets, producing a filtered packet list and a log of
 the activity in which consecutive messages are merged
filterAll :: [Rule] > [Packet] > Writer [Entry] [Packet]
filterAll rules packets = do tell [Log 1 "STARTING PACKET FILTER"]
out < groupSame [] mergeEntries packets (filterOne rules)
tell [Log 1 "STOPPING PACKET FILTER"]
return (catMaybes out)
The Continuation monad
Overview
 Computation type: Computations which can be interrupted and resumed.
 Binding strategy: Binding a function to a monadic value creates a new continuation which uses the function as the continuation of the monadic computation.
 Useful for: Complex control structures, error handling and creating coroutines.
 Zero and plus: None.
 Example type: Cont r a
Motivation
File:Warn.png Abuse of the Continuation monad can produce code that is impossible to understand and maintain.
Before using the Continuation monad, be sure that you have a firm understanding of continuationpassing style (CPS) and that continuations represent the best solution to your particular design problem. Many algorithms which require continuations in other languages do not require them in Haskell, due to Haskell's lazy semantics.
Continuations represent the future of a computation, as a function from an intermediate result to the final result. In continuationpassing style, computations are built up from sequences of nested continuations, terminated by a final continuation (often id
) which produces the final result. Since continuations are functions which represent the future of a computation, manipulation of the continuation functions can achieve complex manipulations of the future of the computation, such as interrupting a computation in the middle, aborting a portion of a computation, restarting a computation and interleaving execution of computations. The Continuation monad adapts CPS to the structure of a monad.
Definition
newtype Cont r a = Cont { runCont :: ((a > r) > r) }  r is the final result type of the whole computation
instance Monad (Cont r) where
return a = Cont $ \k > k a  i.e. return a = \k > k a
(Cont c) >>= f = Cont $ \k > c (\a > runCont (f a) k)  i.e. c >>= f = \k > c (\a > f a k)
The Continuation monad represents computations in continuationpassing style. Cont r a
is a CPS computation that produces an intermediate result of type a
within a CPS computation whose final result type is r
.
The return
function simply creates a continuation which passes the value on. The >>=
operator adds the bound function into the continuation chain.
class (Monad m) ==> MonadCont m where
callCC :: ((a > m b) > m a) > m a
instance MonadCont (Cont r) where
callCC f = Cont $ \k > runCont (f (\a > Cont $ \_ > k a)) k
The MonadCont
class provides the callCC
function, which provides an escape continuation mechanism for use with Continuation monads. Escape continuations allow you to abort the current computation and return a value immediately. They achieve a similar effect to throwError
and catchError within an Error
monad.
callCC
calls a function with the current continuation as its argument (hence the name). The standard idiom used with callCC
is to provide a lambdaexpression to name the continuation. Then calling the named continuation anywhere within its scope will escape from the computation, even if it is many layers deep within nested computations.
In addition to the escape mechanism provided by callCC
, the Continuation monad can be used to implement other, more powerful continuation manipulations. These other mechanisms have fairly specialized uses, however — and abuse of them can easily create fiendishly obfuscated code — so they will not be covered here.
This example gives a taste of how escape continuations work. The example function uses escape continuations to perform a complicated transformation on an integer.
Example 18
{ We use the continuation monad to perform "escapes" from code blocks.
This function implements a complicated control structure to process
numbers:
Input (n) Output List Shown
========= ====== =========
09 n none
10199 number of digits in (n/2) digits of (n/2)
20019999 n digits of (n/2)
200001999999 (n/2) backwards none
>== 2000000 sum of digits of (n/2) digits of (n/2)
}
fun :: Int > String
fun n = (`runCont` id) $ do
str < callCC $ \exit1 > do  define "exit1"
when (n < 10) (exit1 (show n))
let ns = map digitToInt (show (n `div` 2))
n' < callCC $ \exit2 > do  define "exit2"
when ((length ns) < 3) (exit2 (length ns))
when ((length ns) < 5) (exit2 n)
when ((length ns) < 7) $ do let ns' = map intToDigit (reverse ns)
exit1 (dropWhile (=='0') ns') escape 2 levels
return $ sum ns
return $ "(ns = " ++ (show ns) ++ ") " ++ (show n')
return $ "Answer: " ++ str
Monads in the Real World
Introduction
Part I has introduced the monad concept and Part II has provided an understanding of a number of common, useful monads in the standard Haskell libraries. This is not enough to put monads into heavy practice, however, because in the real world you often want computations which combine aspects of more than one monad at the same time, such as stateful, nondetermistic computations or computations which make use of continuations and perform I/O. When one computation is a strict subset of the other, it is possible to perform the monad computations separately, unless the subcomputation is performed in a oneway monad.
Often, the computations can't be performed in isolation. In this case, what is needed is a monad that combines the features of the two monads into a single computation. It is inefficient and poor practice to write a new monad instance with the required characteristics each time a new combination is desired. Instead, we would prefer to develop a way to combine the standard monads to produce the needed hybrids. The technique that lets us do exactly that is called monad transformers.
Monad transformers are the topic of Part III, and they are explained by revisiting earlier examples to see how monad transformers can be used to add more realistic capabilities to them. It may be helpful to review the earlier examples as they are reexamined.
Combining monads the hard way
Combining monads the hard way
Before we investigate the use of monad transformers, we will see how monads can be combined without using transformers. This is a useful excercise to develop insights into the issues that arise when combining monads and provides a baseline from which the advantages of the transformer approach can be measured. We use the code from example 18 (the Continuation monad) to illustrate these issues, so you may want to review it before continuing.
Nested Monads
Some computations have a simple enough structure that the monadic computations can be nested, avoiding the need for a combined monad altogether. In Haskell, all computations occur in the IO monad at the top level, so the monad examples we have seen so far all actually use the technique of nested monadic computations. To do this, the computations perform all of their input at the beginning — usually by reading arguments from the command line — then pass the values on to the monadic computations to produce results, and finally perform their output at the end. This structure avoids the issues of combining monads but makes the examples seem contrived at times.
The code introduced in example 18 followed the nesting pattern: reading a number from the command line in the IO monad, passing that number to a computation in the Continuation monad to produce a string, and then writing the string back in the IO monad. The computations in the IO monad aren't restricted to reading from the command line and writing strings; they can be arbitrarily complex. Likewise, the inner computation can be arbitrarily complex as well. As long as the inner computation does not depend on the functionality of the outer monad, it can be safely nested within the outer monad, as illustrated in this variation on example 18 which reads the value from stdin instead of using a command line argument:
Example 19
fun :: IO String
fun = do n < (readLn::IO Int)  this is an IO monad block
return $ (`runCont` id) $ do  this is a Cont monad block
str < callCC $ \exit1 > do
when (n < 10) (exit1 (show n))
let ns = map digitToInt (show (n `div` 2))
n' < callCC $ \exit2 > do
when ((length ns) < 3) (exit2 (length ns))
when ((length ns) < 5) (exit2 n)
when ((length ns) < 7) $ do let ns' = map intToDigit (reverse ns)
exit1 (dropWhile (=='0') ns')
return $ sum ns
return $ "(ns = " ++ (show ns) ++ ") " ++ (show n')
return $ "Answer: " ++ str
Combined Monads
What about computations with more complicated structure? If the nesting pattern cannot be used, we need a way to combine the attributes of two or more monads in a single computation. This is accomplished by doing computations within a monad in which the values are themselves monadic values in another monad. For example, we might perform computations in the Continuation monad of type Cont (IO String) a
if we need to perform I/O within the computation in the Continuation monad. We could use a monad of type State (Either Err a) a
to combine the features of the State and Error monads in a single computation.
Consider a slight modification to our example in which we perform the same I/O at the beginning, but we may require additional input in the middle of the computation in the Continuation monad. In this case, we will allow the user to specify part of the output value when the input value is within a certain range. Because the I/O depends on part of the computation in the Continuation monad and part of the computation in the Continuation monad depends on the result of the I/O, we cannot use the nested monad pattern.
Instead, we make the computation in the Continuation monad use values from the IO monad. What used to be Int
and String
values are now of type IO Int
and IO String
. We can't extract values from the IO monad — it's a oneway monad — so we may need to nest little doblocks of the IO monad within the Continuation monad to manipulate the values. We use a helper function toIO
to make it clearer when we are creating values in the IO monad nested within the Continuation monad.
Example 20
toIO :: a > IO a
toIO x = return x
fun :: IO String
fun = do n < (readLn::IO Int)  this is an IO monad block
convert n
convert :: Int > IO String
convert n = (`runCont` id) $ do  this is a Cont monad block
str < callCC $ \exit1 > do  str has type IO String
when (n < 10) (exit1 $ toIO (show n))
let ns = map digitToInt (show (n `div` 2))
n' < callCC $ \exit2 > do  n' has type IO Int
when ((length ns) < 3) (exit2 (toIO (length ns)))
when ((length ns) < 5) (exit2 $ do putStrLn "Enter a number:"
x < (readLn::IO Int)
return x)
when ((length ns) < 7) $ do let ns' = map intToDigit (reverse ns)
exit1 $ toIO (dropWhile (=='0') ns')
return (toIO (sum ns))
return $ do num < n'  this is an IO monad block
return $ "(ns = " ++ (show ns) ++ ") " ++ (show num)
return $ do s < str  this is an IO monad block
return $ "Answer: " ++ s
Even this trivial example has gotten confusing and ugly when we tried to combine different monads in the same computation. It works, but it isn't pretty. Comparing the code sidebyside shows the degree to which the manual monad combination strategy pollutes the code.
Nested monads from example 19
fun = do n < (readLn::IO Int)
return $ (`runCont` id) $ do
str < callCC $ \exit1 > do
when (n < 10) (exit1 (show n))
let ns = map digitToInt (show (n `div` 2))
n' < callCC $ \exit2 > do
when ((length ns) < 3) (exit2 (length ns))
when ((length ns) < 5) (exit2 n)
when ((length ns) < 7) $ do
let ns' = map intToDigit (reverse ns)
exit1 (dropWhile (=='0') ns')
return $ sum ns
return $ "(ns = " ++ (show ns) ++ ") " ++ (show n')
return $ "Answer: " ++ str
Manually combined monads from example 20
convert n = (`runCont` id) $ do
str < callCC $ \exit1 > do
when (n < 10) (exit1 $ toIO (show n))
let ns = map digitToInt (show (n `div` 2))
n' < callCC $ \exit2 > do
when ((length ns) < 3) (exit2 (toIO (length ns)))
when ((length ns) < 5) (exit2 $ do
putStrLn "Enter a number:"
x < (readLn::IO Int)
return x)
when ((length ns) < 7) $ do
let ns' = map intToDigit (reverse ns)
exit1 $ toIO (dropWhile (=='0') ns')
return (toIO (sum ns))
return $ do num < n'
return $ "(ns = " ++ (show ns) ++ ") " ++ (show num)
return $ do s < str
return $ "Answer: " ++ s
Monad transformers
Monad transformers are special variants of standard monads that facilitate the combining of monads. Their type constructors are parameterized over a monad type constructor, and they produce combined monadic types.
Transformer type constructors
Type constructors play a fundamental role in Haskell's monad support. Recall that Reader r a
is the type of values of type a
within a Reader monad with environment of type r
. The type constructor Reader r
is an instance of the Monad
class, and the runReader::(r>a)
function performs a computation in the Reader monad and returns the result of type a
.
A transformer version of the Reader monad, called ReaderT
, exists which adds a monad type constructor as an addition parameter. ReaderT r m a
is the type of values of the combined monad in which Reader is the base monad and m
is the inner monad. ReaderT r m
is an instance of the monad class, and the runReaderT::(r > m a)
function performs a computation in the combined monad and returns a result of type m a
.
Using the transformer versions of the monads, we can produce combined monads very simply. ReaderT r IO
is a combined Reader+IO monad. We can also generate the nontransformer version of a monad from the transformer version by applying it to the Identity monad. So ReaderT r Identity
is the same monad as Reader r
.
File:Info.png If your code produces kind errors during compilation, it means that you are not using the type cosntructors properly. Make sure that you have supplied the correct number of parameters to the type constructors and that you have not left out any parenthesis in complex type expressions.
Lifting
When using combined monads created by the monad transformers, we avoid having to explicitly manage the inner monad types, resulting in clearer, simpler code. Instead of creating additional doblocks within the computation to manipulate values in the inner monad type, we can use lifting operations to bring functions from the inner monad into the combined monad.
Recall the liftM
family of functions which are used to lift nonmonadic functions into a monad. Each monad transformer provides a lift
function that is used to lift a monadic computation into a combined monad. Many transformers also provide a liftIO
function, which is a version of lift
that is optimized for lifting computations in the IO
monad. To see this in action, we will continue to develop our previous example in the Continuation monad.
Example 21
fun :: IO String
fun = (`runContT` return) $ do
n < liftIO (readLn::IO Int)
str < callCC $ \exit1 > do  define "exit1"
when (n < 10) (exit1 (show n))
let ns = map digitToInt (show (n `div` 2))
n' < callCC $ \exit2 > do  define "exit2"
when ((length ns) < 3) (exit2 (length ns))
when ((length ns) < 5) $ do liftIO $ putStrLn "Enter a number:"
x < liftIO (readLn::IO Int)
exit2 x
when ((length ns) < 7) $ do let ns' = map intToDigit (reverse ns)
exit1 (dropWhile (=='0') ns') escape 2 levels
return $ sum ns
return $ "(ns = " ++ (show ns) ++ ") " ++ (show n')
return $ "Answer: " ++ str
Compare this function using ContT
, the transformer version of Cont
, with the original version to see how unobtrusive the changes become when using the monad transformer.
Nested monads from example 19
fun = do n < (readLn::IO Int)
return $ (`runCont` id) $ do
str < callCC $ \exit1 > do
when (n < 10) (exit1 (show n))
let ns = map digitToInt (show (n `div` 2))
n' < callCC $ \exit2 > do
when ((length ns) < 3) (exit2 (length ns))
when ((length ns) < 5) (exit2 n)
when ((length ns) < 7) $ do
let ns' = map intToDigit (reverse ns)
exit1 (dropWhile (=='0') ns')
return $ sum ns
return $ "(ns = " ++ (show ns) ++ ") " ++ (show n')
return $ "Answer: " ++ str
Monads combined with a transformer from example 21
fun = (`runContT` return) $ do
n < liftIO (readLn::IO Int)
str < callCC $ \exit1 > do
when (n < 10) (exit1 (show n))
let ns = map digitToInt (show (n `div` 2))
n' < callCC $ \exit2 > do
when ((length ns) < 3) (exit2 (length ns))
when ((length ns) < 5) $ do
liftIO $ putStrLn "Enter a number:"
x < liftIO (readLn::IO Int)
exit2 x
when ((length ns) < 7) $ do
let ns' = map intToDigit (reverse ns)
exit1 (dropWhile (=='0') ns')
return $ sum ns
return $ "(ns = " ++ (show ns) ++ ") " ++ (show n')
return $ "Answer: " ++ str
The impact of adding the I/O in the middle of the computation is narrowly confined when using the monad transformer. Contrast this with the changes required to achieve the same result using a manually combined monad.
Standard monad transformers
Haskell's base libraries provide support for monad transformers in the form of classes which represent monad transformers and special transformer versions of standard monads.
The MonadTrans and MonadIO classes
The MonadTrans
class is defined in Control.Monad.Trans and provides the single function lift
. The lift
function lifts a monadic computation in the inner monad into the combined monad.
class MonadTrans t where
lift :: (Monad m) ==> m a > t m a
Monads which provide optimized support for lifting IO operations are defined as members of the MonadIO
class, which defines the liftIO
function.
class (Monad m) ==> MonadIO m where
liftIO :: IO a > m a
Transformer versions of standard monads
The standard monads of the monad template library all have transformer versions which are defined consistently with their nontransformer versions. However, it is not the case the all monad transformers apply the same transformation. We have seen that the ContT
transformer turns continuations of the form (a>r)>r
into continuations of the form (a>m r)>m r
. The StateT
transformer is different. It turns state transformer functions of the form s>(a,s)
into state transformer functions of the form s>m (a,s)
. In general, there is no magic formula to create a transformer version of a monad — the form of each transformer depends on what makes sense in the context of its nontransformer type.
Standard Monad  Transformer Version  Original Type  Combined Type 

Error  ErrorT  Either e a 
m (Either e a) 
State  StateT  s > (a,s) 
s > m (a,s) 
Reader  ReaderT  r > a 
r > m a 
Writer  WriterT  (a,w) 
m (a,w) 
Cont  ContT  (a > r) > r 
(a > m r) > m r 
File:Info.png Order is important when combining monads. StateT s (Error e)
is different than ErrorT e (State s)
. The first produces a combined type of s > Error e (a,s)
, in which the computation can either return a new state or generate an error. The second combination produces a combined type of s > (Error e a,s)
, in which the computation always returns a new state, and the value can be an error or a normal value.
Anatomy of a monad transformer
In this section, we will take a detailed look at the implementation of one of the more interesting transformers in the standard library, StateT
. Studying this transformer will build insight into the transformer mechanism that you can call upon when using monad transformers in your code. You might want to review the section on the State monad before continuing.
Combined monad definition
Just as the State monad was built upon the definition
newtype State s a = State { runState :: (s > (a,s)) }
the StateT transformer is built upon the definition
newtype StateT s m a = StateT { runStateT :: (s > m (a,s)) }
State s
is an instance of both the Monad
class and the MonadState s
class, so StateT s m
should also be members of the Monad
and MonadState s
classes. Furthermore, if m
is an instance of MonadPlus
, StateT s m
should also be a member of MonadPlus
.
To define StateT s m
as a Monad
instance:
newtype StateT s m a = StateT { runStateT :: (s > m (a,s)) }
instance (Monad m) ==> Monad (StateT s m) where
return a = StateT $ \s > return (a,s)
(StateT x) >>= f = StateT $ \s > do (v,s') < x s  get new value, state
(StateT x') < return $ f v  apply bound function to get new state transformation fn
x' s'  apply the state transformation fn to the new state
Compare this to the definition for State s
. Our definition of return
makes use of the return
function of the inner monad, and the binding operator uses a doblock to perform a computation in the inner monad.
We also want to declare all combined monads that use the StateT
transformer to be instaces of the MonadState
class, so we will have to give definitions for get
and put
:
instance (Monad m) ==> MonadState s (StateT s m) where
get = StateT $ \s > return (s,s)
put s = StateT $ \_ > return ((),s)
Finally, we want to declare all combined monads in which StateT
is used with an instance of MonadPlus
to be instances of MonadPlus
:
instance (MonadPlus m) ==> MonadPlus (StateT s m) where
mzero = StateT $ \s > mzero
(StateT x1) `mplus` (StateT x2) = StateT $ \s > (x1 s) `mplus` (x2 s)
Defining the lifting function
The final step to make our monad transformer fully integrated with Haskell's monad classes is to make StateT s
an instance of the MonadTrans
class by providing a lift
function:
instance MonadTrans (StateT s) where
lift c = StateT $ \s > c >>= (\x > return (x,s))
The lift
function creates a StateT
state transformation function that binds the computation in the inner monad to a function that packages the result with the input state. The result is that a function that returns a list (i.e., a computation in the List monad) can be lifted into StateT s []
, where it becomes a function that returns a StateT (s > [(a,s)])
. That is, the lifted computation produces multiple (value,state) pairs from its input state. The effect of this is to "fork" the computation in StateT, creating a different branch of the computation for each value in the list returned by the lifted function. Of course, applying StateT
to a different monad will produce different semantics for the lift
function.
Functors
We have examined the implementation of one monad transformer above, and it was stated earlier that there was no magic formula to produce transformer versions of monads. Each transformer's implementation will depend on the nature of the computational effects it is adding to the inner monad.
Despite this, there is some theoretical foundation to the theory of monad transformers. Certain transformers can be grouped according to how they use the inner monad, and the transformers within each group can be derived using monadic functions and functors. Functors, roughly, are types which support a mapping operation fmap :: (a>b) > f a > f b
. To learn more about it, check out Mark Jones' influential paper that inspired the Haskell monad template library.
More examples with monad transformers
At this point, you should know everything you need to begin using monads and monad transformers in your programs. The best way to build proficiency is to work on actual code. As your monadic programs become more abitious, you may find it awkward to mix additional transformers into your combined monads. This will be addressed in the next section, but first you should master the basic process of applying a single transformer to a base monad.
WriterT with IO
Try adapting the firewall simulator of example 17 to include a timestamp on each log entry (don't worry about merging entries). The necessary changes should look something like this:
Example 22
 this is the format of our log entries
data Entry = Log {timestamp::ClockTime, msg::String} deriving Eq
instance Show Entry where
show (Log t s) = (show t) ++ "  " ++ s
 this is the combined monad type
type LogWriter a = WriterT [Entry] IO a
 add a message to the log
logMsg :: String > LogWriter ()
logMsg s = do t < liftIO getClockTime
tell [Log t s]
 this handles one packet
filterOne :: [Rule] > Packet > LogWriter (Maybe Packet)
filterOne rules packet = do rule < return (match rules packet)
case rule of
Nothing > do logMsg ("DROPPING UNMATCHED PACKET: " ++ (show packet))
return Nothing
(Just r) > do when (logIt r) (logMsg ("MATCH: " ++ (show r) ++ " <=> " ++ (show packet)))
case r of
(Rule Accept _ _) > return (Just packet)
(Rule Reject _ _) > return Nothing
 this filters a list of packets, producing a filtered packet list
 and a log of the activity
filterAll :: [Rule] > [Packet] > LogWriter [Packet]
filterAll rules packets = do logMsg "STARTING PACKET FILTER"
out < mapM (filterOne rules) packets
logMsg "STOPPING PACKET FILTER"
return (catMaybes out)
 read the rule data from the file named in the first argument, and the packet data from
 the file named in the second argument, and then print the accepted packets followed by
 a log generated during the computation.
main :: IO ()
main = do args < getArgs
ruleData < readFile (args!!0)
packetData < readFile (args!!1)
let rules = (read ruleData)::[Rule]
packets = (read packetData)::[Packet]
(out,log) < runWriterT (filterAll rules packets)
putStrLn "ACCEPTED PACKETS"
putStr (unlines (map show out))
putStrLn "\n\nFIREWALL LOG"
putStr (unlines (map show log))
ReaderT with IO
If you found that one too easy, move on to a slightly more complex example: convert the template system in example 16 from using a single template file with named templates to treating individual files as templates. One possible solution is shown in [[../examples/example23.hsexample 23]], but try to do it without looking first.
Example 23
{ We use the Parsec monadic parser combinator library to parse
template files }
import Text.ParserCombinators.Parsec
import Text.ParserCombinators.Parsec.Token
import IO hiding (try)  "try" is also defined in the Parsec libraries
import qualified IO (try)
import Monad
import System
import List (intersperse)
import Control.Monad.Reader
 This the abstract syntax representation of a template
 Text Variable Quote Include Compound
data Template = T String  V Template  Q Template  I Template [Definition]  C [Template]
data Definition = D Template Template
 Templates are members of the Show class
instance Show Template where
show (T s) = s
show (V t) = "${" ++ (show t) ++ "}"
show (Q t) = "$\"" ++ (show t) ++ "\""
show (I t ds) = let name = (show t)
definitions = concat (intersperse ", " (map show ds))
in case definitions of
[] > "$<" ++ name ++ ">"
otherwise > "$<" ++ name ++ "" ++ definitions ++ ">"
show (C ts) = concatMap show ts
instance Show Definition where
show (D t d) = (show t) ++ "=" ++ (show d)
{ Here we define a parser for templates. }
 parse a (possibly compound) template.
 the [Char] argument is a list of characters not allowed in the template.
template :: [Char] > Parser Template
template except = do ts < many1 (simpleTemplate except)
case ts of
[t] > return t
otherwise > return (C ts)
 parse a simple template: text, a variable pattern, a quote pattern, or a include pattern
 the [Char] argument is a list of characters not allowed in the template.
simpleTemplate :: [Char] > Parser Template
simpleTemplate except = (text except)
<> (try variable)
<> (try quote)
<> include
 parse a dollarsign that doesn't begin a variable, quote, or include pattern
dollar :: Parser Char
dollar = try (do c < char '$'
notFollowedBy (oneOf "{<\"")
return c)
<?> ""
 parse a character that isn't part of a pattern and
 isn't in the list of excluded characters.
textChar :: [Char] > Parser Char
textChar except = noneOf ("$" ++ except) <> dollar
 parse a string of allowed characters
 the [Char] argument is a list of characters not allowed in the text.
text :: [Char] > Parser Template
text except = do str < many1 (textChar except)
return (T str)
<?> "text"
 parse a variable pattern
variable :: Parser Template
variable = do t < between (string "${") (char '}') (template "}")
return (V t)
<?> "variable pattern"
 parse a quotedinclusion pattern
quote :: Parser Template
quote = do t < between (string "$\"") (char '\"') (template "\"")
return (Q t)
<?> "quoted include pattern"
 parse a resolvedinclusion pattern
include :: Parser Template
include = between (string "$<") (char '>') includeBody
<?> "include pattern"
 parse the body of an inclusion pattern
includeBody :: Parser Template
includeBody = do t < (template ">")
ds < option [] definitions
return (I t ds)
 parse a list of definitions
definitions :: Parser [Definition]
definitions = do char ''
ds < definition `sepBy1` (char ',')
return ds
 parse a single definition
definition :: Parser Definition
definition = do t1 < (template "=,>")
char '='
t2 < (template ",>")
return (D t1 t2)
<?> "variable definition"
 Our environment consists of an association list of named variable values
 an association list of named variable values.
type Environment = [(String,String)]
 lookup a variable from the environment
lookupVar :: String > Environment > Maybe String
lookupVar = lookup
 add a list of resolved definitions to the environment
addDefs :: [(String,String)] > Environment > Environment
addDefs = (++)
 this is the type of our monad
type TemplateReader a = ReaderT Environment IO a
 resolve a Definition and produce a (name,value) pair
resolveDef :: Definition > TemplateReader (String,String)
resolveDef (D t d) = do name < resolve t
value < resolve d
return (name,value)
 resolve a template into a string
resolve :: Template > TemplateReader String
resolve (T s) = return s
resolve (V t) = do varName < resolve t
varValue < asks (lookupVar varName)
case varValue of
Just s > return s
Nothing > return ""
resolve (Q t) = do tmplName < resolve t
body < liftIO $ IO.try (readFile tmplName)
case body of
Left err > do liftIO $ hPutStrLn stderr (show err)
return ""
Right s > return s
resolve (I t ds) = do tmplName < resolve t
body < liftIO $ IO.try (parseFromFile (template []) tmplName)
case body of
Left err > do liftIO $ hPutStrLn stderr (show err)
return ""
Right (Left err') > do liftIO $ hPutStrLn stderr (show err')
return ""
Right (Right t') > do defs < mapM resolveDef ds
local (addDefs defs) (resolve t')
resolve (C ts) = (liftM concat) (mapM resolve ts)
 Read the command line arguments, parse the template file, the user template, and any
 variable definitions. Then construct the environment and print the resolved user template.
main :: IO ()
main = do args < getArgs
let pattern = args!!0
defs = map (break (=='=')) (drop 1 args)  split into ("var","=value")
env = map (\ (x,y) > (x,tail y)) defs  get rid of '='
case parse (template []) "template" pattern of
Left err > hPutStrLn stderr (show err)
Right t > (runReaderT (resolve t) env) >>= putStr
 END OF FILE
StateT with List
The previous examples have all been using the IO monad as the inner monad. Here is a more interesting example: combining StateT
with the List monad to produce a monad for stateful nondeterministic computations.
We will apply this powerful monad combination to the task of solving constraint satisfaction problems (in this case, a logic problem). The idea behind it is to have a number of variables that can take on different values and a number of predicates involving those variables that must be satisfied. The current variable assignments and the predicates make up the state of the computation, and the nondeterministic nature of the List monad allows us to easily test all combinations of variable assignments.
We start by laying the groundwork we will need to represent the logic problem, a simple predicate language:
Example 24
 First, we develop a language to express logic problems
type Var = String
type Value = String
data Predicate = Is Var Value  var has specific value
 Equal Var Var  vars have same (unspecified) value
 And Predicate Predicate  both are true
 Or Predicate Predicate  at least one is true
 Not Predicate  it is not true
deriving (Eq, Show)
type Variables = [(Var,Value)]
 test for a variable NOT equaling a value
isNot :: Var > Value > Predicate
isNot var value = Not (Is var value)
 if a is true, then b must also be true
implies :: Predicate > Predicate > Predicate
implies a b = Not (a `And` (Not b))
 exclusive or
orElse :: Predicate > Predicate > Predicate
orElse a b = (a `And` (Not b)) `Or` ((Not a) `And` b)
 Check a predicate with the given variable bindings.
 An unbound variable causes a Nothing return value.
check :: Predicate > Variables > Maybe Bool
check (Is var value) vars = do val < lookup var vars
return (val == value)
check (Equal v1 v2) vars = do val1 < lookup v1 vars
val2 < lookup v2 vars
return (val1 == val2)
check (And p1 p2) vars = liftM2 (&&) (check p1 vars) (check p2 vars)
check (Or p1 p2) vars = liftM2 () (check p1 vars) (check p2 vars)
check (Not p) vars = liftM (not) (check p vars)
The next thing we will need is some code for representing and solving constraint satisfaction problems. This is where we will define our combined monad.
 this is the type of our logic problem
data ProblemState = PS {vars::Variables, constraints::[Predicate]}
 this is our monad type for nondeterminstic computations with state
type NDS a = StateT ProblemState [] a
 lookup a variable
getVar :: Var > NDS (Maybe Value)
getVar v = do vs < gets vars
return $ lookup v vs
 set a variable
setVar :: Var > Value > NDS ()
setVar v x = do st < get
vs' < return $ filter ((v/=).fst) (vars st)
put $ st {vars=(v,x):vs'}
 Check if the variable assignments satisfy all of the predicates.
 The partial argument determines the value used when a predicate returns
 Nothing because some variable it uses is not set. Setting this to True
 allows us to accept partial solutions, then we can use a value of
 False at the end to signify that all solutions should be complete.
isConsistent :: Bool > NDS Bool
isConsistent partial = do cs < gets constraints
vs < gets vars
let results = map (\p>check p vs) cs
return $ and (map (maybe partial id) results)
 Return only the variable bindings that are complete consistent solutions.
getFinalVars :: NDS Variables
getFinalVars = do c < isConsistent False
guard c
gets vars
 Get the first solution to the problem, by evaluating the solver computation with
 an initial problem state and then returning the first solution in the result list,
 or Nothing if there was no solution.
getSolution :: NDS a > ProblemState > Maybe a
getSolution c i = listToMaybe (evalStateT c i)
 Get a list of all possible solutions to the problem by evaluating the solver
 computation with an initial problem state.
getAllSolutions :: NDS a > ProblemState > [a]
getAllSolutions c i = evalStateT c i
We are ready to apply the predicate language and stateful nondeterministic monad to solving a logic problem. For this example, we will use the wellknown Kalotan puzzle which appeared in Mathematical BrainTeasers, Dover Publications (1976), by J. A. H. Hunter.
The Kalotans are a tribe with a peculiar quirk: their males always tell the truth. Their females never make two consecutive true statements, or two consecutive untrue statements. An anthropologist (let's call him Worf) has begun to study them. Worf does not yet know the Kalotan language. One day, he meets a Kalotan (heterosexual) couple and their child Kibi. Worf asks Kibi: ``Are you a boy? The kid answers in Kalotan, which of course Worf doesn't understand. Worf turns to the parents (who know English) for explanation. One of them says: "Kibi said: `I am a boy.'" The other adds: "Kibi is a girl. Kibi lied." Solve for the sex of Kibi and the sex of each parent.
We will need some additional predicates specific to this puzzle, and to define the universe of allowed variables values:
 if a male says something, it must be true
said :: Var > Predicate > Predicate
said v p = (v `Is` "male") `implies` p
 if a male says two things, they must be true
 if a female says two things, one must be true and one must be false
saidBoth :: Var > Predicate > Predicate > Predicate
saidBoth v p1 p2 = And ((v `Is` "male") `implies` (p1 `And` p2))
((v `Is` "female") `implies` (p1 `orElse` p2))
 lying is saying something is true when it isn't or saying something isn't true when it is
lied :: Var > Predicate > Predicate
lied v p = ((v `said` p) `And` (Not p)) `orElse` ((v `said` (Not p)) `And` p)
 Test consistency over all allowed settings of the variable.
tryAllValues :: Var > NDS ()
tryAllValues var = do (setVar var "male") `mplus` (setVar var "female")
c < isConsistent True
guard c
All that remains to be done is to define the puzzle in the predicate language and get a solution that satisfies all of the predicates:
 Define the problem, try all of the variable assignments and print a solution.
main :: IO ()
main = do let variables = []
constraints = [ Not (Equal "parent1" "parent2"),
"parent1" `said` ("child" `said` ("child" `Is` "male")),
saidBoth "parent2" ("child" `Is` "female")
("child" `lied` ("child" `Is` "male")) ]
problem = PS variables constraints
print $ (`getSolution` problem) $ do tryAllValues "parent1"
tryAllValues "parent2"
tryAllValues "child"
getFinalVars
Each call to tryAllValues
will fork the solution space, assigning the named variable to be "male"
in one fork and "female"
in the other. The forks which produce inconsistent variable assignments are eliminated (using the guard
function). The call to getFinalVars
applies guard
again to eliminate inconsistent variable assignments and returns the remaining assignments as the value of the computation.
Managing the transformer stack
As the number of monads combined together increases, it becomes increasingly important to manage the stack of monad transformers well.
Selecting the correct order
Once you have decided on the monad features you need, you must choose the correct order in which to apply the monad transformers to achieve the results you want. For instance you may know that you want a combined monad that is an instance of MonadError
and MonadState
, but should you apply StateT
to the Error
monad or ErrorT
to the State
monad?
The decision depends on the exact semantics you want for your combined monad. Applying StateT
to the Error
monad gives a state transformer function of type s > Error e (a,s)
. Applying ErrorT
to the State
monad gives a state transformer function of type s > (Error e a,s)
. Which order to choose depends on the role of errors in your computation. If an error means no state could be produced, you would apply StateT
to Error
. If an error means no value could be produced, but the state remains valid, then you would apply ErrorT
to State
.
Choosing the correct order requires understanding the transformation carried out by each monad transformer, and how that transformation affects the semantics of the combined monad.
An example with multiple transformers
The following example demonstrates the use of multiple monad transformers. The code uses the StateT monad transformer along with the List monad to produce a combined monad for doing stateful nondeterministic computations. In this case, however, we have added the WriterT
monad transformer to perform logging during the computation. The problem we will apply this monad to is the famous Nqueens problem: to place N queens on a chess board so that no queen can attack another.
The first decision is in what order to apply the monad transformers. StateT s (WriterT w [])
yields a type like: s > [((a,s),w)]
. WriterT w (StateT s [])
yields a type like: s > [((a,w),s)]
. In this case, there is little difference between the two orders, so we will choose the second arbitrarily.
Our combined monad is an instance of both MonadState
and MonadWriter
, so we can freely mix use of get
, put
, and tell
in our monadic computations.
Example 25
 this is the type of our problem description
data NQueensProblem = NQP {board::Board,
ranks::[Rank], files::[File],
asc::[Diagonal], desc::[Diagonal]}
 initial state = empty board, all ranks, files, and diagonals free
initialState = let fileA = map (\r>Pos A r) [1..8]
rank8 = map (\f>Pos f 8) [A .. H]
rank1 = map (\f>Pos f 1) [A .. H]
asc = map Ascending (nub (fileA ++ rank1))
desc = map Descending (nub (fileA ++ rank8))
in NQP (Board []) [1..8] [A .. H] asc desc
 this is our combined monad type for this problem
type NDS a = WriterT [String] (StateT NQueensProblem []) a
 Get the first solution to the problem, by evaluating the solver computation with
 an initial problem state and then returning the first solution in the result list,
 or Nothing if there was no solution.
getSolution :: NDS a > NQueensProblem > Maybe (a,[String])
getSolution c i = listToMaybe (evalStateT (runWriterT c) i)
 add a Queen to the board in a specific position
addQueen :: Position > NDS ()
addQueen p = do (Board b) < gets board
rs < gets ranks
fs < gets files
as < gets asc
ds < gets desc
let b' = (Piece Black Queen, p):b
rs' = delete (rank p) rs
fs' = delete (file p) fs
(a,d) = getDiags p
as' = delete a as
ds' = delete d ds
tell ["Added Queen at " ++ (show p)]
put (NQP (Board b') rs' fs' as' ds')
 test if a position is in the set of allowed diagonals
inDiags :: Position > NDS Bool
inDiags p = do let (a,d) = getDiags p
as < gets asc
ds < gets desc
return $ (elem a as) && (elem d ds)
 add a Queen to the board in all allowed positions
addQueens :: NDS ()
addQueens = do rs < gets ranks
fs < gets files
allowed < filterM inDiags [Pos f r  f < fs, r < rs]
tell [show (length allowed) ++ " possible choices"]
msum (map addQueen allowed)
 Start with an empty chess board and add the requested number of queens,
 then get the board and print the solution along with the log
main :: IO ()
main = do args < getArgs
let n = read (args!!0)
cmds = replicate n addQueens
sol = (`getSolution` initialState) $ do sequence_ cmds
gets board
case sol of
Just (b,l) > do putStr $ show b  show the solution
putStr $ unlines l  show the log
Nothing > putStrLn "No solution"
The program operates in a similar manner to the previous example, which solved the kalotan puzzle. In this example, however, we do not test for consistency using the guard
function. Instead, we only create branches that correspond to allowed queen positions. We use the added logging facility to log the number of possible choices at each step and the position in which the queen was placed.
Heavy lifting
There is one subtle problem remaining with our use of multiple monad transformers. Did you notice that all of the computations in the previous example are done in the combined monad, even if they only used features of one monad? The code for these functions in tied unneccessarily to the definition of the combined monad, which decreases their reusability.
This is where the lift
function from the MonadTrans
class comes into its own. The lift
function gives us the ability to write our code in a clear, modular, reusable manner and then lift the computations into the combined monad as needed.
Instead of writing brittle code like:
logString :: String > StateT MyState (WriterT [String] []) Int
logString s = ...
we can write clearer, more flexible code like:
logString :: (MonadWriter [String] m) ==> String > m Int
logString s = ...
and then lift the logString
computation into the combined monad when we use it.
File:Info.png You may need to use the compiler flags fglasgowexts
with GHC or the equivalent flags with your Haskell compiler to use this technique. The issue is that m
in the constraint above is a type constructor, not a type, and this is not supported in standard Haskell 2010.
When using lifting with complex transformer stacks, you may find yourself composing multiple lifts, like lift . lift . lift $ f x
. This can become hard to follow, and if the transformer stack changes (perhaps you add ErrorT
into the mix) the lifting may need to be changed all over the code. A good practice to prevent this is to declare helper functions with informative names to do the lifting:
liftListToState = lift . lift . lift
Then, the code is more informative and if the transformer stack changes, the impact on the lifting code is confined to a small number of these helper functions.
The hardest part about lifting is understanding the semantics of lifting computations, since this depends on the details of the inner monad and the transformers in the stack. As a final task, try to understand the different roles that lifting plays in the following example code. Can you predict what the output of the program will be?
Example 26
 this is our combined monad type for this problem
type NDS a = StateT Int (WriterT [String] []) a
{ Here is a computation on lists }
 return the digits of a number as a list
getDigits :: Int > [Int]
getDigits n = let s = (show n)
in map digitToInt s
{ Here are some computations in MonadWriter }
 write a value to a log and return that value
logVal :: (MonadWriter [String] m) ==> Int > m Int
logVal n = do tell ["logVal: " ++ (show n)]
return n
 do a logging computation and return the length of the log it wrote
getLogLength :: (MonadWriter [[a]] m) ==> m b > m Int
getLogLength c = do (_,l) < listen $ c
return (length (concat l))
 log a string value and return 0
logString :: (MonadWriter [String] m) ==> String > m Int
logString s = do tell ["logString: " ++ s]
return 0
{ Here is a computation that requires a WriterT [String] [] }
 "Fork" the computation and log each list item in a different branch.
logEach :: (Show a) ==> [a] > WriterT [String] [] a
logEach xs = do x < lift xs
tell ["logEach: " ++ (show x)]
return x
{ Here is a computation in MonadState }
 increment the state by a specified value
addVal :: (MonadState Int m) ==> Int > m ()
addVal n = do x < get
put (x+n)
{ Here are some computations in the combined monad }
 set the state to a given value, and log that value
setVal :: Int > NDS ()
setVal n = do x < lift $ logVal n
put x
 "Fork" the computation, adding a different digit to the state in each branch.
 Because setVal is used, the new values are logged as well.
addDigits :: Int > NDS ()
addDigits n = do x < get
y < lift . lift $ getDigits n
setVal (x+y)
{ an equivalent construction is:
addDigits :: Int > NDS ()
addDigits n = do x < get
msum (map (\i>setVal (x+i)) (getDigits n))
}
{ This is an example of a helper function that can be used to put all of the lifting logic
in one location and provide more informative names. This has the advantage that if the
transformer stack changes in the future (say, to add ErrorT) the changes to the existing
lifting logic are confined to a small number of functions.
}
liftListToNDS :: [a] > NDS a
liftListToNDS = lift . lift
 perform a series of computations in the combined monad, lifting computations from other
 monads as necessary.
main :: IO ()
main = do mapM_ print $ runWriterT $ (`evalStateT` 0) $ do x < lift $ getLogLength $ logString "hello"
addDigits x
x < lift $ logEach [1,3,5]
lift $ logVal x
liftListToNDS $ getDigits 287
Once you fully understand how the various lifts in the example work and how lifting promotes code reuse, you are ready for realworld monadic programming. All that is left to do is to hone your skills writing real software. Happy hacking!
Continuing Exploration
This brings us to the end of this tutorial. If you want to continue learning about the mathematical foundations of monads, there are numerous category theory resources on the internet. For more examples of monads and their applications in the real world, you might want to explore the design of the Parsec monadic parser combinator library and/or the QuickCheck testing tool. You may also be interested in arrows, which are similar to monads but more general.
If you discover any errors — no matter how small — in this document, or if you have suggestions for how it can be improved, please write to the author at jnewbern@yahoo.com.
A physical analogy for monads
Because monads are such abstract entities, it is sometimes useful to think about a physical system that is analogous to a monad instead of thinking about monads directly. In this way, we can use our physical intuition and experiences to gain insights that we can relate back to the abstract world of computational monads.
The particular physical analogy developed here is that of a mechanized assembly line. It is not a perfect fit for monads — especially with some of the higherorder aspects of monadic computation — but I believe it could be helpful to gain the initial understanding of how a monad works.
Begin by thinking about a Haskell program as a conveyor belt. Input goes on end of the conveyor belt and is carried to a succession of work areas. At each work area, some operation is performed on the item on the conveyor belt and the result is carried by the conveyor belt to the next work area. Finally, the conveyor belt carries the final product to the end of the assembly line to be output.
In this assembly line model, our physical monad is a system of machines that controls how successive work areas on the assembly line combine their functionality to create the overall product.
Our monad consists of three parts:
 Trays that hold work products as they move along the conveyor belt.
 Loader machines that can put any object into a tray.
 Combiner machines that can take a tray with an object and produce a tray with a new object. These combiner machines are attached to worker machines that actualy produce the new objects.
We use the monad by setting up our assembly line as a loader machine which puts materials into trays at the beginning of the assembly line. The conveyor belt then carries these trays to each work area, where a combiner machine takes the tray and may decide based on its contents whether to run them through a worker machine, as shown in Figure A1.
<tbody> </tbody>File:FigureA1.png 
Figure A1. An assembly line using a monad architecture. 
The important thing to notice about the monadic assembly line is that it separates out the work of combining the output of the worker machines from the actual work done by the worker machines. Once they are separated, we can vary them independently. So the same combiner machines could be used on an assembly line to make airplanes and an assembly line to make chopsticks. Likewise, the same worker machines could be used with different combiners to alter the way the final product is produced.
Lets take the example of an assembly line to make chopsticks, and see how it is handled in our physical analogy and how me might represent it as a program in Haskell. We will have three worker machines. The first takes small pieces of wood as input and outputs a tray containing a pair of roughly shaped chopsticks. The second takes a pair of roughly shaped chopsticks and outputs a tray containing a pair of smooth, polished chopsticks with the name of the restaurant printed on them. The third takes a pair of polished chopsticks and outputs a tray containing a finished pair of chopsticks in a printed paper wrapper. We could represent this in Haskell as:
 the basic types we are dealing with
type Wood = ...
type Chopsticks = ...
data Wrapper x = Wrapper x
 NOTE: the Tray type comes from the Tray monad
 worker function 1: makes roughly shaped chopsticks
makeChopsticks :: Wood > Tray Chopsticks
makeChopsticks w = ...
 worker function 2: polishes chopsticks
polishChopsticks :: Chopsticks > Tray Chopsticks
polishChopsticks c = ...
 worker function 3: wraps chopsticks
wrapChopsticks :: Chopsticks > Tray Wrapper Chopsticks
wrapChopsticks c = ...
It is clear that the worker machines contain all of the functionality needed to produce chopsticks. What is missing is the specification of the trays, loader, and combiner machines that collectively make up the Tray monad. Our trays should either be empty or contain a single item. Our loader machine would simply take an item and place it in a tray on the conveyor belt. The combiner machine would take each input tray and pass along empty trays while feeding the contents of nonempty trays to its worker machine. In Haskell, we would define the Tray
monad as:
 trays are either empty or contain a single item
data Tray x = Empty  Contains x
 Tray is a monad
instance Monad Tray where
Empty >>= _ = Empty
(Contains x) >>= worker = worker x
return = Contains
fail _ = Empty
File:Info.png You may recognize the Tray
monad as a disguised version of the Maybe
monad that is a standard part of Haskell 2010 library.
All that remains is to sequence the worker machines together using the loader and combiner machines to make a complete assembly line, as shown in Figure A2.
File:FigureA2.png 
Figure A2. A complete assembly line for making chopsticks using a monadic approach. 
In Haskell, the sequencing can be done using the standard monadic functions:
assemblyLine :: Wood > Tray Wrapped Chopsticks
assemblyLine w = (return w) >>= makeChopsticks >>= polishChopsticks >>= wrapChopsticks
or using the built in Haskell "do" notation for monads:
assemblyLine :: Wood > Tray Wrapped Chopsticks
assemblyLine w = do c < makeChopsticks w
c' < polishChopsticks c
c'' < wrapChopsticks c'
return c''
So far, you have seen how monads are like a framework for building assembly lines, but you probably haven't been overawed by their utility. To see why we might want to build our assembly line using the monadic approach, consider what would happen if we wanted to change the manufacturing process.
Right now, when a worker machine malfunctions, it uses the fail
routine to produce an empty tray. The fail
routine takes an argument describing the failure, but our Tray
type ignores this and simply produces an empty tray. This empty tray travels down the assembly line and the combiner machines allow it to bypass the remaining worker machines. It eventually reaches the end of the assembly line, where it is brought to you, the quality control engineer. It is your job to figure out which machine failed, but all you have to go on is an empty tray.
You realize that your job would be much easier if you took advantage of the failure messages that are currently ignored by the fail
routine in your Tray
monad. Because your assembly line is organized around a monadic approach, it is easy for you to add this functionality to your assembly line without changing your worker machines.
To make the change, you simply create a new tray type that can never be empty. It will always either contain an item or it will contain a failure report describing the exact reason there is no item in the tray.
 tray2s either contain a single item or contain a failure report
data Tray2 x = Contains x  Failed String
 Tray2 is a monad
instance Monad Tray2 where
(Failed reason) >>= _ = Failed reason
(Contains x) >>= worker = worker x
return = Contains
fail reason = Failed reason
File:Info.png You may recognize the Tray2
monad as a disguised version of the Error
monad that is a standard part of the Haskell 2010 libraries.
Replacing the Tray
monad with the Tray2
monad instantly upgrades your assembly line. Now when a failure occurs, the tray that is brought to the quality control engineer contains a failure report detailing the exact cause of the failure!
Haskell code examples
This appendix contains a list of all of the code supplied with the tutorial. The source code can be found here.
Example 1
This example is discussed in the section: Meet the Monads.
The example code introduces the monad concept without using Haskell typeclasses. It shows how a monadic combinator can be used to simplify the construction of computations from sequences of computations which may not return a result.
Example 2
This example is discussed in the section: Doing it with class
The example code builds on the first example, and shows how donotation can be used with an instance of the Monad
class (in this case, Maybe
is the monad used).
Example 3
This example is discussed in the section: Monad support in Haskell.
The example code builds on the first two examples, and shows a somewhat atypical — but very powerful — use of the foldM
function outside of a doblock.
Example 4
This example is discussed in the section: Monad support in Haskell.
The example code shows a more typical use of the foldM
function within a doblock. It combines dictionary values read from different files into a single dictionary using the foldM
function within the IO monad.
Example 5
This example is discussed in the section: Monad support in Haskell.
The example code shows the use of the filterM
function within a doblock. It prints the subset of its arguments that specify directories and ignores nondirectory arguments.
Example 6
This example is discussed in the section: Monad support in Haskell.
The example code shows the use of the liftM
function within a doblock. It looks up a name in a list and uses a lifted String manipulation function to modify it within the Maybe monad.
Example 7
This example is discussed in the section: Monad support in Haskell.
The example code shows a higherorder application of liftM2
. It folds lifted operations within the List monad to produce lists of all combinations of elements combined with the lifted operator.
Example 8
This example is discussed in the section: Monad support in Haskell.
The example code shows a higherorder application of ap
. It folds ap
through a list of Maybe (a>a)
functions to process sequences of commands.
Example 9
This example is discussed in the section: Monad support in Haskell.
The example code shows the use of msum
in the Maybe monad to select the first variable match in a stack of binding environments.
Example 10
This example is discussed in the section: Monad support in Haskell.
The example code shows the use of guard
in the Maybe monad to select only the records from a list that satisfy a predicate (equivalent to filter
).
Example 11
This example is discussed in the section: The Maybe monad.
The example code shows how to use the Maybe
monad to build complex queries from simpler queries that may fail to return a result. The specific example used is looking up mail preferences for someone based on either their full name or a nickname.
Example 12
This example is discussed in the section: The Error monad.
The example code demonstrates the use of the Either
type constructor as an Error
monad with a custom error type. The example parses hexadecimal digits and uses the exception handling mechanism of the Error
monad to provide informative error messages in the event of a parse failure.
Example 13
This example is discussed in the section: The List monad.
The example code uses the builtin list type constructor as a monad for nondeterministic computation. The example demonstrates parsing an ambiguous grammar consisting of integers, hex values, and words.
Example 14
This example is discussed in the section: The IO monad.
The example code implements a simple version of the standard Unix command "tr". The example demonstrates use of the IO monad including implicit fail
calls due to pattern matching failures and the use of catcherror
.
Example 15
This example is discussed in the section: The State monad.
The example code shows how the State monad can be used instead of explicitly passing state. The example uses the State monad to manage the random number generator state while building a compound data value requiring multiple calls to the random number generator.
Example 16
This example is discussed in the section: The Reader monad.
The example code shows how the Reader monad can be used to simplify computations involving a shared environment. The example uses the Reader monad to implement a simple template substitution system. The example code demonstrates the use of the Parsec monadic parser combinator library.
Example 17
This example is discussed in the section: The Writer monad.
The example code shows how the Writer monad can be used to implement logging. The example implements a very simple firewall simulator and uses the Writer monad to log the firewall activity.
Example 18
This example is discussed in the section: The Continuation monad.
The example code shows how the Continuation monad's escape continuations work. The example computes a complex transformation of a number.
Example 19
This example is discussed in the section: Combining monads the hard way.
The example code shows how the Continuation monad can be nested within the IO monad given a suitable computational structure. The example is a slight modification of example 18.
Example 20
This example is discussed in the section: Combining monads the hard way.
The example code shows how the Continuation monad and IO monad can be used simultaneously, but without using monad transformers. The example builds on examples 18 and 19.
Example 21
This example is discussed in the section: Monad transformers.
The example code shows how the transformer version of the Continuation monad can be used to create a combined monad for using continuations and doing I/O. The example builds on examples 18, 19 and 20.
Example 22
This example is discussed in the section: Standard monad transformers.
The example code shows how the transformer version of the Writer monad can be used to create a combined monad for logging and doing I/O. The example adds timestamps to the log entries of the firewall simulator from example 17.
Example 23
This example is discussed in the section: Standard monad transformers.
The example code shows how the transformer version of the Reader monad can be used to create a monad that combines a shared environment with I/O. The example converts the template system of example 16 to use files as templates.
Example 24
This example is discussed in the section: Standard monad transformers.
The example code uses the StateT
transformer on the List monad to create a combined monad for doing nondeterministic stateful computations. The example uses the combined monad to solve a logic problem.
Example 25
This example is discussed in the section: An example with multiple monad transformers.
The example code uses the StateT
and WriterT
transformers on the List monad to create a combined monad for doing nondeterministic stateful computations with logging. The example uses the combined monad to solve the Nqueens problem.
Example 26
This example is discussed in the section: Heavy lifting.
The example code demonstrates the use of the lift
function and the necessity of managing its use in complex transformer stacks.