[Haskell-cafe] Re: Re: A free monad theorem?
u.stenzel at web.de
Sun Sep 3 11:46:37 EDT 2006
Lennart Augustsson wrote:
> Well, bind is extracting an 'a'. I clearly see a '\ a -> ...'; it
> getting an 'a' so it can give that to g. Granted, the extraction is
> very convoluted, but it's there.
Oh, that can be remedied...
> m >>= g = m . flip g
In fact, why even mention m?
> (>>=) = (. flip) . (.)
Anyway, there's no "a extracted from m", since a function cannot be
deconstructed. That lets the "free theorem" degenerate into "m >>= k
does something with m and/or k, most of the time", which is kinda
meaningless and explains exactly nothing.
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Size: 189 bytes
Desc: Digital signature
Url : http://www.haskell.org//pipermail/haskell-cafe/attachments/20060903/dbc06f12/attachment.bin
More information about the Haskell-Cafe