Mini ML

Wolfgang Naraschewski and Tobias Nipkow

19 March 2004

Abstract

This theory defines the type inference rules and the type inference algorithm W for MiniML (simply-typed lambda terms with let) due to Milner. It proves the soundness and completeness of W w.r.t. the rules.
BSD License

Topics

Theories

Cite

×
@article{MiniML-AFP,
  author  = {Wolfgang Naraschewski and Tobias Nipkow},
  title   = {Mini ML},
  journal = {Archive of Formal Proofs},
  month   = March,
  year    = 2004,
  note    = {\url{http://isa-afp.org/entries/MiniML.html},
            Formal proof development},
  ISSN    = {2150-914x},
}
Download