Your post feels similar to another one posted recently... http://web.jaguarpaw.co.uk/~tom/blog/2012/09/02/what-is-a-monad-really.html
just fyi, :-), kris On Tue, Sep 4, 2012 at 6:39 AM, Alberto G. Corona <[email protected]> wrote: > "Monads are monoids in the category of endofunctors" > > This Monoid instance for the endofunctors of the set of all elements > of (m a) typematch in Haskell with FlexibleInstances: > > instance Monad m => Monoid (a -> m a) where > mappend = (>=>) -- kleisly operator > mempty = return > > The article can be found here: > > http://haskell-web.blogspot.com.es/2012/07/from-monads-to-monoids-in-small.html > > I would appreciate some comments. > > _______________________________________________ > Haskell-Cafe mailing list > [email protected] > http://www.haskell.org/mailman/listinfo/haskell-cafe _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
