diff -r a1a18530c4ac -r 0ccea141409b src/HOL/MiniML/README.html --- 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 @@ HOL/MiniML/README -

Type Inference for MiniML (without let)

+

Type Inference for MiniML

This theory defines the type inference rules and the type inference algorithm W for simply-typed lambda terms due to Milner. It proves the -soundness and completeness of W w.r.t. to the rules. An optimized -version I is shown to implement W. +soundness and completeness of W w.r.t. to the rules.

A report describing the theory is found here:
- -Formal Verification of Algorithm W: The Monomorphic Case. + +Type Inference Verified: Algorithm W in Isabelle/HOL.