Unification in typed lambda calculus
- 22 November 2005
- book chapter
- Published by Springer Nature
- p. 192-212
- https://doi.org/10.1007/bfb0029526
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A lower bound for the length of addition chainsTheoretical Computer Science, 1975
- The undecidability of unification in third order logicInformation and Control, 1973
- A Complete Mechanization of Second-Order Type TheoryJournal of the ACM, 1973
- Resolution in type theoryThe Journal of Symbolic Logic, 1971
- Functionals defined by recursion.Notre Dame Journal of Formal Logic, 1967
- A MATCHING PROCEDURE FOR W-ORDER LOGICPublished by Defense Technical Information Center (DTIC) ,1966
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965
- A formulation of the simple theory of typesThe Journal of Symbolic Logic, 1940