Proposal: Max and Min for Monoid
conal at conal.net
Thu Sep 23 19:20:55 EDT 2010
That extra bit bothered me, too. One could split AddBound into AddMax and
AddMin. Perhaps better is to fix the problem upstream, splitting Bounded
into WithMin and WithMax.
On Thu, Sep 23, 2010 at 3:46 PM, Ross Paterson <ross at soi.city.ac.uk> wrote:
> On Thu, Sep 23, 2010 at 03:08:48PM -0400, Edward Kmett wrote:
> > On the other hand, composing AddBounds introduces another element on the
> > side, which serves as an annihilator when composed with Min and Max. This
> > fine for some applications, but I don't believe it subsumes MinPriority
> > MaxPriority.
> This extra element at the other end introduced by AddBounds bothers
> me too. So I agree with the conclusion that we need both versions that
> add a maximum/minimum, and ones that take it from Bounded. That leaves
> the question of which variant deserves to be called Max/Min.
> Libraries mailing list
> Libraries at haskell.org
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Libraries