On Wed, 8 Jan 2003, Andrew J Bromage wrote:
> One is to allow function overloading. This is probably not desirable
> because it turns type checking into an NP-hard problem.
it already is much harder (even without static overloading)
Helmut Seidl. : Haskell overloading is DEXPTIME-complete.
Information Processing Letters 52(2), 57-60, 1994.
http://www.informatik.uni-trier.de/~seidl/papers/type.ps
and extensions make it worse (hence `ghc -fallow-undecidable-instances`)
which doesn't stop them from being useful.
--
-- Johannes Waldmann ---- http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/207 --
_______________________________________________
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
