Complete restrictions of the intersection type discipline
- 3 August 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 102 (1) , 135-163
- https://doi.org/10.1016/0304-3975(92)90297-s
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- Principal type scheme and unification for intersection type disciplineTheoretical Computer Science, 1988
- Polymorphic type inference and containmentInformation and Computation, 1988
- Type theories, normal forms, and D∞-lambda-modelsInformation and Computation, 1987
- A characterization of F-complete type assignmentsTheoretical Computer Science, 1986
- Principal type schemes for an extended type theoryTheoretical Computer Science, 1983
- The completeness theorem for typing λ-termsTheoretical 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