[Haskell-cafe] A free monad theorem?
bulat.ziganshin at gmail.com
Fri Sep 1 02:48:24 EDT 2006
Thursday, August 31, 2006, 9:23:55 PM, you wrote:
> The background for my question is an argument I had some time ago with
> someone about what the 'real nature' of monads is. He argued that monads
> are mainly about 'chaining' (somehow wrapped up) values in an associative
> way, refering to the monad laws.
my understanding of monads is that monad is a way to combine
functions. 'bind' operator defines algorithm of this combining for
each concrete monad. some monads thread values, some spread them, some
just sequence computations
Bulat mailto:Bulat.Ziganshin at gmail.com
More information about the Haskell-Cafe