| author | urbanc | 
| Tue, 01 Nov 2005 23:54:29 +0100 | |
| changeset 18052 | 004515accc10 | 
| parent 15582 | 7219facb3fd0 | 
| permissions | -rw-r--r-- | 
| 15283 | 1 | <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> | 
| 2 | ||
| 15582 | 3 | <!-- $Id$ --> | 
| 4 | ||
| 5 | <HTML> | |
| 6 | ||
| 7 | <HEAD> | |
| 8 | <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1"> | |
| 9 | <TITLE>HOL/W0/README</TITLE> | |
| 10 | </HEAD> | |
| 11 | ||
| 2518 
bee082efaa46
This is the old version og MiniML for the monomorphic case.
 nipkow parents: diff
changeset | 12 | <BODY> | 
| 
bee082efaa46
This is the old version og MiniML for the monomorphic case.
 nipkow parents: diff
changeset | 13 | |
| 
bee082efaa46
This is the old version og MiniML for the monomorphic case.
 nipkow parents: diff
changeset | 14 | <H1>Type Inference for MiniML (without <tt>let</tt>)</H1> | 
| 
bee082efaa46
This is the old version og MiniML for the monomorphic case.
 nipkow parents: diff
changeset | 15 | |
| 
bee082efaa46
This is the old version og MiniML for the monomorphic case.
 nipkow parents: diff
changeset | 16 | This theory defines the type inference rules and the type inference algorithm | 
| 
bee082efaa46
This is the old version og MiniML for the monomorphic case.
 nipkow parents: diff
changeset | 17 | <em>W</em> for simply-typed lambda terms due to Milner. It proves the | 
| 
bee082efaa46
This is the old version og MiniML for the monomorphic case.
 nipkow parents: diff
changeset | 18 | soundness and completeness of <em>W</em> w.r.t. to the rules. An optimized | 
| 
bee082efaa46
This is the old version og MiniML for the monomorphic case.
 nipkow parents: diff
changeset | 19 | version <em>I</em> is shown to implement <em>W</em>. | 
| 
bee082efaa46
This is the old version og MiniML for the monomorphic case.
 nipkow parents: diff
changeset | 20 | |
| 
bee082efaa46
This is the old version og MiniML for the monomorphic case.
 nipkow parents: diff
changeset | 21 | <P> | 
| 
bee082efaa46
This is the old version og MiniML for the monomorphic case.
 nipkow parents: diff
changeset | 22 | |
| 
bee082efaa46
This is the old version og MiniML for the monomorphic case.
 nipkow parents: diff
changeset | 23 | A report describing the theory is found here:<br> | 
| 
bee082efaa46
This is the old version og MiniML for the monomorphic case.
 nipkow parents: diff
changeset | 24 | <A HREF = "http://www4.informatik.tu-muenchen.de/~nipkow/pubs/tphol96.html"> | 
| 
bee082efaa46
This is the old version og MiniML for the monomorphic case.
 nipkow parents: diff
changeset | 25 | Formal Verification of Algorithm W: The Monomorphic Case</A>. | 
| 
bee082efaa46
This is the old version og MiniML for the monomorphic case.
 nipkow parents: diff
changeset | 26 | |
| 
bee082efaa46
This is the old version og MiniML for the monomorphic case.
 nipkow parents: diff
changeset | 27 | <P> | 
| 
bee082efaa46
This is the old version og MiniML for the monomorphic case.
 nipkow parents: diff
changeset | 28 | |
| 
bee082efaa46
This is the old version og MiniML for the monomorphic case.
 nipkow parents: diff
changeset | 29 | <B>NOTE:</B> This theory has been superseded by a more recent development | 
| 
bee082efaa46
This is the old version og MiniML for the monomorphic case.
 nipkow parents: diff
changeset | 30 | which formalizes type inference for a language including <tt>let</tt>. For | 
| 
bee082efaa46
This is the old version og MiniML for the monomorphic case.
 nipkow parents: diff
changeset | 31 | details click <A HREF="../MiniML/index.html">here</A>. | 
| 
bee082efaa46
This is the old version og MiniML for the monomorphic case.
 nipkow parents: diff
changeset | 32 | </BODY> | 
| 
bee082efaa46
This is the old version og MiniML for the monomorphic case.
 nipkow parents: diff
changeset | 33 | </HTML> |