src/HOL/W0/README.html
author nipkow
Wed Aug 18 11:09:40 2004 +0200 (2004-08-18)
changeset 15140 322485b816ac
parent 2518 bee082efaa46
child 15283 f21466450330
permissions -rw-r--r--
import -> imports
nipkow@2518
     1
<HTML><HEAD><TITLE>HOL/W0/README</TITLE></HEAD>
nipkow@2518
     2
<BODY>
nipkow@2518
     3
nipkow@2518
     4
<H1>Type Inference for MiniML (without <tt>let</tt>)</H1>
nipkow@2518
     5
nipkow@2518
     6
This theory defines the type inference rules and the type inference algorithm
nipkow@2518
     7
<em>W</em> for simply-typed lambda terms due to Milner. It proves the
nipkow@2518
     8
soundness and completeness of <em>W</em> w.r.t. to the rules. An optimized
nipkow@2518
     9
version <em>I</em> is shown to implement <em>W</em>.
nipkow@2518
    10
nipkow@2518
    11
<P>
nipkow@2518
    12
nipkow@2518
    13
A report describing the theory is found here:<br>
nipkow@2518
    14
<A HREF = "http://www4.informatik.tu-muenchen.de/~nipkow/pubs/tphol96.html">
nipkow@2518
    15
Formal Verification of Algorithm W: The Monomorphic Case</A>.
nipkow@2518
    16
nipkow@2518
    17
<P>
nipkow@2518
    18
nipkow@2518
    19
<B>NOTE:</B> This theory has been superseded by a more recent development
nipkow@2518
    20
which formalizes type inference for a language including <tt>let</tt>. For
nipkow@2518
    21
details click <A HREF="../MiniML/index.html">here</A>.
nipkow@2518
    22
</BODY>
nipkow@2518
    23
</HTML>