[Haskell-cafe] Type Inference for Overloading without Restrictions

[Peter Verswyvelen]

A while ago, someone provided me a link to the paper "Type Inference
for Overloading without Restrictions"
http://www.dcc.ufmg.br/~camarao/ct-flops99.ps.gz

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?

Thanks,
Peter Verswyvelen