Dear Haskellers For a long time now, Mark Shields and I have been writing a paper describing GHC's approach to type inference for higher-rank types. We've finally finished a complete draft: Practical type inference for arbitrary-rank types Simon Peyton Jones and Mark Shields http://research.microsoft.com/~simonpj/papers/putting/index.htm The paper has a strongly tutorial flavour, and comes complete with a prototype implementation that you can play with. My hope is that, in addition to describing higher-rank stuff, the paper may serve as a kind of tutorial on type inference generally, and the use of monads to support the plumbing in particular. There's nothing really new about this aspect of the paper, but I don't know of a comparable tutorial that takes a monadic approach. It's still very much a draft, so I'd be very interested in your feedback about it. Simon
G'day all. On Mon, Jul 07, 2003 at 11:23:59AM +0100, Simon Peyton-Jones wrote:
The paper has a strongly tutorial flavour, and comes complete with a prototype implementation that you can play with.
Does the prototype implementation not support recursive lets? *Main> tcs "let fix = (\\f . f (fix f)) in fix" Not in scope: `fix' Cheers, Andrew Bromage
participants (2)
-
Andrew J Bromage -
Simon Peyton-Jones