Proposal: Max and Min for Monoid

[Edward Kmett]

Yes, typo. =)

On Sat, Sep 25, 2010 at 1:09 PM, Henning Thielemann <
schlepptop at henning-thielemann.de> wrote:

> Edward Kmett schrieb:
> > If you want a more uniform factoring, then at the risk of further
> > exploding the number of options under consideration, there is an obvious
> > choice:
> >
> > class Semigroup s where
> >    sappend :: s -> s -> s
> >
> > -- ^ like how Functor m => Monoid m, you get the obvious 'spiritual but
> > unenforced' Semigroup m => Monoid m
>
> Functor m => Monad m ?
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/libraries/attachments/20100925/e9979656/attachment-0001.html