# 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 equivalent to *W* (one direction only).
A report describing the theory is found here:

Formal Verification of Algorithm W: The Monomorphic Case.