author nipkow
Wed, 22 May 1996 17:11:54 +0200
changeset 1757 f7a573c46611
parent 1753 88e0d3160909
child 2523 0ccea141409b
permissions -rw-r--r--
Added the second half of the W/I correspondence.


<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 to implement <em>W</em>.


A report describing the theory is found here:<br>
<A HREF = "">
Formal Verification of Algorithm W: The Monomorphic Case</A>.