On Nov 19, 2010, at 6:22 PM, Aaron Gray wrote:
>
> IIRC It Does not deal Hindley-Milner type system at all. i.e. it does not
> cover ML's type system.
>
> Its successor ATTAPL :-
>
> http://www.cis.upenn.edu/~bcpierce/attapl/index.html
>
> Handles an ML like type systems using constraints.
TAPL certainly covers the basic ML system -- which is pretty much the typed
lambda calculus with first order polymorphism. What it doesn't do is cover type
inference (or "reconstruction") in any depth, although it does actually sketch
at least one algorithm for HM type inference (including constraints) -- see
chapter 22. You're right that ATTAPL covers much more in the realm of type
inference, as well as plenty else.
Cheers,
Sterl.
_______________________________________________
Haskell-Cafe mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell-cafe
