[Haskell-cafe] tighter bounds for Data.Map operations (using min(n.m))?

Johannes Waldmann johannes.waldmann at htwk-leipzig.de
Wed Feb 10 15:32:21 UTC 2016

Previous message: [Haskell-cafe] tighter bounds for Data.Map operations (using min(n.m))?
Next message: [Haskell-cafe] Why do we want levity polymorphism?
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

See also https://github.com/haskell/containers/issues/177
(which I found only now) - J.W.

Previous message: [Haskell-cafe] tighter bounds for Data.Map operations (using min(n.m))?
Next message: [Haskell-cafe] Why do we want levity polymorphism?
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

More information about the Haskell-Cafe mailing list