//
In particular, it would be nice to be able to specialise based on the
instances, as we do for [a] -- [Int], e.g.
RULES sum = sumInt :: [Int] - Int
is fine in the current system. So I could imagine some nice
specialisations based on say, the good old Ord:
RULES nub = nubOrd ::
haskell:
Is there any way to use RULES substitutions with type classes?
I'm writing a reactive programming arrow (same idea as Yampa, different
design goals), and it would help performance (and not just in the speed
sense) to be able to tell when a value derived with arr hasn't changed.
So
On 29/03/2007, at 11:38, Mike Hamburg wrote:
Is there any way to use RULES substitutions with type classes?
I'm writing a reactive programming arrow (same idea as Yampa,
different
design goals), and it would help performance (and not just in the
speed
sense) to be able to tell when
