Formal Veri cation of Algorithm W: The
Download:
pdf
by Dieter Nazareth, Tobias Nipkow
http://www4.in.tum.de/publ/papers/NazarethNipkow_TPiH1996.pdf
Add To MetaCart
Abstract:
Abstract. A formal veri cation of the soundness and completeness of Milner's type inference algorithm W for simply typed lambda-terms is presented. Particular attention is paid to the notorious issue of \new" variables. The proofs are carried out in Isabelle/HOL, the HOL instantiation of the generic theorem prover Isabelle. 1
Citations
| 1654 | Foundations of Logic Programming – Lloyd - 1984 |
| 217 | Principal type schemes for functional programs – Damas, Milner - 1982 |
| 215 | Report on the Programming Language Haskell, A Non-strict, Purely Functional Language – Hudak, Jones, et al. - 1992 |
| 168 | Solving equations in abstract algebras: a rule-based survey of unification – Jouannaud, Kirchner - 1991 |
| 113 | The principal type-scheme of an object in combinatory logic – Hindley - 1969 |
| 112 | de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation – G - 1972 |
| 91 | Type Assignment in Programming Languages – Damas - 1985 |
| 88 | A Simple Applicative Language: MINI-ML – Clement - 1986 |
| 67 | Basic polymorphic typechecking – Cardelli - 1987 |
| 46 | Introduction to HOL (A theorem-proving environment for higher order logic – Gordon, Melham - 1993 |
| 28 | Pure type systems formalized – McKinna, Pollack - 1993 |
| 11 | Quali ed types: Theory and practice – Jones - 1992 |
| 11 | Uni cation revisited – Lassez, Maher, et al. - 1988 |
