<html><head></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space; "><div><div>On Nov 19, 2010, at 6:22 PM, Aaron Gray wrote:</div><br class="Apple-interchange-newline"><blockquote type="cite"><div class="gmail_quote"><div><br></div><div>IIRC It Does not deal Hindley-Milner type system at all. i.e. it does not cover ML's type system.</div><div><br></div><div>Its successor ATTAPL :-</div>
<div><br></div><div> <a href="http://www.cis.upenn.edu/~bcpierce/attapl/index.html">http://www.cis.upenn.edu/~bcpierce/attapl/index.html</a></div><div><br></div><div>Handles an ML like type systems using constraints.</div>
</div></blockquote><br></div><div>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.</div><div><br></div><div>Cheers,</div><div>Sterl.</div></body></html>