src/HOL/MiniML/README.html
author nipkow
Thu, 22 Feb 1996 18:35:16 +0100
changeset 1519 f999804f11ea
parent 1345 d4e26f632bca
child 1752 7dfc3c217414
permissions -rw-r--r--
Added links to documentation

<HTML><HEAD><TITLE>HOL/MiniML/README</TITLE></HEAD>
<BODY>

<H1>Type Inference for MiniML (without <kb>let<kb>)</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 the
soundness and completeness of <em>W</em> w.r.t. to the rules. An optimized
version <em>I</em> is shown equivalent to <em>W</em> (one direction only).

<P>

A report describing the theory is found here:<br>
<A HREF = "http://www4.informatik.tu-muenchen.de/~nipkow/pubs/W0.html">
Formal Verification of Algorithm W: The Monomorphic Case</A>.

</BODY>
</HTML>