|
1519
|
1 |
<HTML><HEAD><TITLE>HOL/MiniML/README</TITLE></HEAD>
|
|
|
2 |
<BODY>
|
|
|
3 |
|
|
|
4 |
<H1>Type Inference for MiniML (without <kb>let<kb>)</H1>
|
|
1337
|
5 |
|
|
1519
|
6 |
This theory defines the type inference rules and the type inference algorithm
|
|
|
7 |
<em>W</em> for simply-typed lambda terms due to Milner. It proves the
|
|
|
8 |
soundness and completeness of <em>W</em> w.r.t. to the rules. An optimized
|
|
1753
|
9 |
version <em>I</em> is shown to implement <em>W</em>.
|
|
1519
|
10 |
|
|
1345
|
11 |
<P>
|
|
|
12 |
|
|
1519
|
13 |
A report describing the theory is found here:<br>
|
|
1752
|
14 |
<A HREF = "http://www4.informatik.tu-muenchen.de/~nipkow/pubs/tphol96.html">
|
|
1519
|
15 |
Formal Verification of Algorithm W: The Monomorphic Case</A>.
|
|
1345
|
16 |
|
|
|
17 |
</BODY>
|
|
|
18 |
</HTML>
|