rank-n polymorphism

Hal Daume III hdaume@ISI.EDU
Thu, 7 Mar 2002 09:11:08 -0800 (PST)

Someone already sent you the Odersky paper, but in brief, there is no
type inference (as it is undecidable).  Rank-n polymorphism can only
happen via explicit type signatures.  My understanding is that if these
type signatures are not there, GHC will automatically lift all the foralls
to the front in type inference.

 - Hal

Hal Daume III

 "Computer science is no more about computers    | hdaume@isi.edu
  than astronomy is about telescopes." -Dijkstra | www.isi.edu/~hdaume

On Thu, 7 Mar 2002, Artem S Alimarine wrote:

> Dear all,
> GHC 5.0.3 supports  rank-n polymorphism.
> Could anyone please point me to a paper that describes type inference
> algorithm used.
> Thanks in advance
> Artem Alimarine
> _______________________________________________
> Haskell mailing list
> Haskell@haskell.org
> http://www.haskell.org/mailman/listinfo/haskell