equal
deleted
inserted
replaced
1 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> |
|
2 |
|
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 |
|
12 <BODY> |
|
13 |
|
14 <H1>Type Inference for MiniML (without <tt>let</tt>)</H1> |
|
15 |
|
16 This theory defines the type inference rules and the type inference algorithm |
|
17 <em>W</em> for simply-typed lambda terms due to Milner. It proves the |
|
18 soundness and completeness of <em>W</em> w.r.t. to the rules. An optimized |
|
19 version <em>I</em> is shown to implement <em>W</em>. |
|
20 |
|
21 <P> |
|
22 |
|
23 A report describing the theory is found here:<br> |
|
24 <A HREF = "http://www4.informatik.tu-muenchen.de/~nipkow/pubs/tphol96.html"> |
|
25 Formal Verification of Algorithm W: The Monomorphic Case</A>. |
|
26 |
|
27 <P> |
|
28 |
|
29 <B>NOTE:</B> This theory has been superseded by a more recent development |
|
30 which formalizes type inference for a language including <tt>let</tt>. For |
|
31 details click <A HREF="../MiniML/index.html">here</A>. |
|
32 </BODY> |
|
33 </HTML> |
|