I kicked off a discussion 5 years ago (according to trac) and suggested the Bounded solution. I still miss these instances and find myself redefining them. It bothers me, however that the Bounded constraint is unnecessarily restrictive. We only need UpperBounded for Min and LowerBounded for Max. -- Conal On Sat, Dec 29, 2012 at 3:02 PM, Henning Thielemann < lemming@henning-thielemann.de> wrote:
On Thu, 27 Dec 2012, Henning Thielemann wrote:
On Thu, 27 Dec 2012, Gabriel Gonzalez wrote:
I don't know if this has been brought up before or not, but would it be
possible to add the Maximum and Minimum monoids to Data.Monoid? The following implementations extend the traditional semigroups using Maybe.
I remember there was a discussion on this topic some years ago. If you want I may search for the old discussion.
I think that it was the discussion on "Proposal: Max and Min for Monoid" started by Jake McArthur: http://www.haskell.org/**pipermail/libraries/2010-** September/014347.htmlhttp://www.haskell.org/pipermail/libraries/2010-September/014347.html
But it seems that the discussion was already performed once more.
______________________________**_________________ Libraries mailing list Libraries@haskell.org http://www.haskell.org/**mailman/listinfo/librarieshttp://www.haskell.org/mailman/listinfo/libraries