polymorphic recursion (was: Re: Implict parameters and monomorphism)

[Fergus Henderson]

On 06-May-2001, Bernard James POPE <bjpop@cs.mu.OZ.AU> wrote:
> 
> If you applied the Mercury algorithm to Haskell (ie used fixed point iteration
> to search for a type, rather than requiring a type annotation), would 
> the new type inference algorithm accept/reject the same programs as the
> existing Haskell algorithm? (assuming an arbitrary user-defined iteration
> limit, and suitable type annotations for the existing Haskell algorithm).

Yes, I believe so.

-- 
Fergus Henderson <fjh@cs.mu.oz.au>  |  "I have always known that the pursuit
                                    |  of excellence is a lethal habit"
WWW: <http://www.cs.mu.oz.au/~fjh>  |     -- the last words of T. S. Garp.