Here is the ticket information. Will ---------- Forwarded message ---------- From: GHC <trac@galois.com> Date: 2009/2/19 Subject: [GHC] #3036: Max/Min Monoids To: Cc: glasgow-haskell-bugs@haskell.org #3036: Max/Min Monoids -----------------------------+---------------------------------------------- Reporter: whpearson | Owner: Type: proposal | Status: new Priority: normal | Component: libraries/base Version: 6.10.1 | Severity: normal Keywords: | Testcase: Os: Unknown/Multiple | Architecture: Unknown/Multiple -----------------------------+---------------------------------------------- A small patch to Data.Monoid to give Max a and Min a monoids for (Ord a, Bounded a) = > a. Very similar to Sum and Product. Some alternatives here for unbounded Max/Mins http://hpaste.org/fastcgi/hpaste.fcgi/view?id=1528 My current preferred one is to not to bother and perhaps put Data.AddBounds in the main branch and people can wrap Integers in that if they want. It seems conceptually purer. -- Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/3036> GHC <http://www.haskell.org/ghc/> The Glasgow Haskell Compiler