[Haskell-cafe] Type Inference for Overloading without Restrictions
bugfact at gmail.com
Wed Jan 13 04:57:16 EST 2010
A while ago, someone provided me a link to the paper "Type Inference
for Overloading without Restrictions"
Although I don't understand everything in this paper, I wander what
people's opinions are about this regarding a future Haskell language
revision or extension?
Would a feature like this be preferable over typeclasses? Would it be
practical to implement? Are people working on this?
More information about the Haskell-Cafe