Fergus Henderson wrote:
> > Is there any Haskell implementation that supports polymorphic recursion
> > without the need of annotating the types for defined function by the
> > programmer?
>
> Not as far as I know.
>
> However, the current Mercury implementation supports this.
This sounds interesting but how did you implement it?
As far as I know, the problem of type inference with polymorphic
recursion is undecidable due to the undecidability of the
semi-unification problem.
---
Michael Hanus
Informatik II eMail: [EMAIL PROTECTED], [EMAIL PROTECTED]
RWTH Aachen Phone: +49-241/80-21230
D-52056 Aachen Fax: +49-241/8888-217
Germany WWW: http://www-i2.informatik.rwth-aachen.de/~hanus/
