src/HOL/MiniML/README.html
author nipkow
Tue, 21 May 1996 10:50:40 +0200
changeset 1752 7dfc3c217414
parent 1519 f999804f11ea
child 1753 88e0d3160909
permissions -rw-r--r--
Updated url.

<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/tphol96.html">
Formal Verification of Algorithm W: The Monomorphic Case</A>.

</BODY>
</HTML>