Intersection type assignment systems
- 27 November 1995
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 151 (2) , 385-435
- https://doi.org/10.1016/0304-3975(95)00073-6
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- Principal Typing in a ∀Λ-DisciplineJournal of Logic and Computation, 1995
- Principal Type Schemes for the Strict Type Assignment SystemJournal of Logic and Computation, 1993
- A characterization of F-complete type assignmentsTheoretical Computer Science, 1986
- Principal type schemes for an extended type theoryTheoretical Computer Science, 1983
- A filter lambda model and the completeness of type assignmentThe Journal of Symbolic Logic, 1983
- Functional Characters of Solvable TermsMathematical Logic Quarterly, 1981
- An extension of the basic functionality theory for the $\lambda$-calculus.Notre Dame Journal of Formal Logic, 1980
- Lambda‐Calculus Models and ExtensionalityMathematical Logic Quarterly, 1980
- Intensional interpretations of functionals of finite type IThe Journal of Symbolic Logic, 1967