[Haskell-cafe] A free monad theorem?

[Andrea Rossato]

Il Thu, Aug 31, 2006 at 07:23:55PM +0200, Benjamin Franksen ebbe a scrivere:
> I argued that monadic values get 'chained' in a very specific way and that
> in order to get an intuition about what this monadic chaining really means
> on the most general level, the standard model of 'computation that returns
> a value of type a' is the appropriate one. 

If you pardon my ascii art, you can have a look here, where I try to
visualize what bind does.

http://www.haskell.org/haskellwiki/The_Monadic_Way#What_Does_Bind_Bind.3F

Monad is of type M (Int,String)
with 

(>>=) m f = (b, x ++ y)
            where (a, x) = m
                  (b, y) = f a

I don't know if this helps.
Andrea