2 May
2010
2 May
'10
6:52 a.m.
would you have any suggestions on a name for such a class or names for the methods?
I'm afraid I don't. I'd like class Pointed t where point :: a -> t a class Monoid m where id :: m (.) :: m -> m -> m constraint Monoidy t = (Pointed t, Monoid (t a)) (although I'm not a big fan of the involved names except for the Monoid class) But the above is currently impractical for various reasons ;) (more than those listed in [1]). Sebastian [1] Haskell Type Constraints Unleashed http://www.cs.kuleuven.be/~toms/Research/papers/constraint_families.pdf -- Underestimating the novelty of the future is a time-honored tradition. (D.G.)