Type inference verified: Algorithm W in Isabelle/HOL
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 317-332
- https://doi.org/10.1007/bfb0097799
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Pure type systems formalizedPublished by Springer Nature ,2005
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- Compiler verification in LFPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Type Reconstruction for Type ClassesJournal of Functional Programming, 1995
- Functional unification of higher-order patternsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- Verifying the unification algorithm in LCFScience of Computer Programming, 1985
- Principal type-schemes for functional programsPublished by Association for Computing Machinery (ACM) ,1982
- HOPEPublished by Association for Computing Machinery (ACM) ,1980
- Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theoremIndagationes Mathematicae, 1972
- The Principal Type-Scheme of an Object in Combinatory LogicTransactions of the American Mathematical Society, 1969