Formal Verification of Algorithm W: The Monomorphic Case (1996)
Cached
Download Links
- [www4.in.tum.de]
- [wwwbroy.informatik.tu-muenchen.de]
- [www4.informatik.tu-muenchen.de]
- [wwwbroy.informatik.tu-muenchen.de]
- [www4.in.tum.de]
- DBLP
Other Repositories/Bibliography
by
Dieter Nazareth
,
Tobias Nipkow
| Citations: | 9 - 1 self |
BibTeX
@MISC{Nazareth96formalverification,
author = {Dieter Nazareth and Tobias Nipkow},
title = {Formal Verification of Algorithm W: The Monomorphic Case},
year = {1996}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A formal verification 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.
