This is the old version og MiniML for the monomorphic case.
The new version is now in MiniML.
<HTML><HEAD><TITLE>HOL/W0/README</TITLE></HEAD><BODY><H1>Type Inference for MiniML (without <tt>let</tt>)</H1>This theory defines the type inference rules and the type inference algorithm<em>W</em> for simply-typed lambda terms due to Milner. It proves thesoundness and completeness of <em>W</em> w.r.t. to the rules. An optimizedversion <em>I</em> is shown to implement <em>W</em>.<P>A report describing the theory is found here:<br><A HREF = "http://www4.informatik.tu-muenchen.de/~nipkow/pubs/tphol96.html">Formal Verification of Algorithm W: The Monomorphic Case</A>.<P><B>NOTE:</B> This theory has been superseded by a more recent developmentwhich formalizes type inference for a language including <tt>let</tt>. Fordetails click <A HREF="../MiniML/index.html">here</A>.</BODY></HTML>