Inhabitation in typed lambda-calculi (a syntactic approach)
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 373-389
- https://doi.org/10.1007/3-540-62688-3_47
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Type reconstruction in Fω is undecidablePublished by Springer Nature ,2005
- The emptiness problem for intersection typesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Typability and type checking in the second-order λ-calculus are equivalent and undecidablePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Polymorphic type inferencePublished by Association for Computing Machinery (ACM) ,1983
- Semantical Investigations in Heyting’s Intuitionistic LogicPublished by Springer Nature ,1981
- Intuitionistic propositional logic is polynomial-space completeTheoretical Computer Science, 1979
- Embedding first order predicate logic in fragments of intuitionistic logicThe Journal of Symbolic Logic, 1976
- On 2nd order intuitionistic propositional calculus with full comprehensionArchive for Mathematical Logic, 1974