Intersection and union types
- 1 January 1991
- book chapter
- Published by Springer Nature
- p. 651-674
- https://doi.org/10.1007/3-540-54415-1_69
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Domain theory in logical form*Annals of Pure and Applied Logic, 1991
- Discrete polymorphismPublished by Association for Computing Machinery (ACM) ,1990
- An ideal model for recursive polymorphic typesInformation and Control, 1986
- Automatic synthesis of typed Λ-programs on term algebrasTheoretical Computer Science, 1985
- The completeness theorem for typing λ-termsTheoretical Computer Science, 1983
- A filter lambda model and the completeness of type assignmentThe Journal of Symbolic Logic, 1983
- Coppo-Dezani types do not correspond to propositional logicTheoretical Computer Science, 1983
- What is a model of the lambda calculus?Information and Control, 1982
- Functional Characters of Solvable TermsMathematical Logic Quarterly, 1981
- A completeness theorem in modal logicThe Journal of Symbolic Logic, 1959