Updated documentation pointers.
Fri, 17 Jan 1997 18:32:24 +0100
changeset 2523 0ccea141409b
parent 2522 a1a18530c4ac
child 2524 dd0f298b024c
Updated documentation pointers.
--- a/src/HOL/MiniML/README.html	Fri Jan 17 18:20:22 1997 +0100
+++ b/src/HOL/MiniML/README.html	Fri Jan 17 18:32:24 1997 +0100
@@ -1,18 +1,17 @@
-<H1>Type Inference for MiniML (without <kb>let<kb>)</H1>
+<H1>Type Inference for MiniML</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>.
+soundness and completeness of <em>W</em> w.r.t. to the rules.
 A report describing the theory is found here:<br>
-<A HREF = "http://www4.informatik.tu-muenchen.de/~nipkow/pubs/tphol96.html">
-Formal Verification of Algorithm W: The Monomorphic Case</A>.
+<A HREF = "http://www4.informatik.tu-muenchen.de/~nipkow/pubs/W.html">
+Type Inference Verified: Algorithm <i>W</i> in Isabelle/HOL</A>.