Formal Verification of Algorithm W: The Monomorphic Case

@inproceedings{Nazareth1996FormalVO,
  title={Formal Verification of Algorithm W: The Monomorphic Case},
  author={Dieter Nazareth and Tobias Nipkow},
  booktitle={TPHOLs},
  year={1996}
}
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 instan tiation of the generic theorem prover Isabelle 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 24 references

A v eriied typechecker

  • R Pollack
  • Typed L ambda Calculi and Applications, v olume…
  • 1995

Isabelle: A Generic Theorem Prover, v olume 828 of Lect

  • L C Paulson
  • Notes in Comp. Sci
  • 1994

Introduction to HOL: a theorem-proving environment for higher-order logic

  • M Gordon, T Melham
  • Introduction to HOL: a theorem-proving…
  • 1993

Qualiied Types: Theory and Practice

  • M P Jones
  • Qualiied Types: Theory and Practice
  • 1992

Similar Papers

Loading similar papers…