Decidability of higher-order subtyping with intersection types
- 1 January 1995
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Simple type-theoretic foundations for object-oriented programmingJournal of Functional Programming, 1994
- Coherence of subsumption, minimum typing and type-checking in F ≤Mathematical Structures in Computer Science, 1992
- PER models of subtyping, recursive types and higher-order polymorphismPublished by Association for Computing Machinery (ACM) ,1992
- Inheritance is not subtypingPublished by Association for Computing Machinery (ACM) ,1990
- Toward a typed foundation for method specialization and inheritancePublished by Association for Computing Machinery (ACM) ,1990
- F-bounded polymorphism for object-oriented programmingPublished by Association for Computing Machinery (ACM) ,1989
- A semantics of multiple inheritanceInformation and Computation, 1988
- On understanding types, data abstraction, and polymorphismACM Computing Surveys, 1985
- A filter lambda model and the completeness of type assignmentThe Journal of Symbolic Logic, 1983
- A new type assignment for λ-termsArchive for Mathematical Logic, 1978