Type Inference for MiniML (without let)
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.
A report describing the theory is found here:
Formal Verification of Algorithm W: The Monomorphic Case.
NOTE: This theory has been superseded by a more recent development
which formalizes type inference for a language including let. For
details click here.