Jon Strait wrote:
I'm reading the third (bind associativity) law for monads in this form:m >>= (\x -> k x >>= h) = (m >>= k) >>= h
Arguably, that law would be better stated as: (h <=< k) <=< m = h <=< (k <=< m) This wouldn't be so unintuitive. - Jake _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe