Higher-order subtyping
- 20 April 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 176 (1-2) , 235-282
- https://doi.org/10.1016/s0304-3975(96)00096-5
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- A unifying type-theoretic framework for objectsJournal of Functional Programming, 1995
- Decidability of higher-order subtyping with intersection typesPublished by Springer Nature ,1995
- A paradigmatic object-oriented programming language: Design, static typing and semanticsJournal of Functional Programming, 1994
- Simple type-theoretic foundations for object-oriented programmingJournal of Functional Programming, 1994
- Recursive types are not conservative over F≤Published by Springer Nature ,1993
- Coherence of subsumption, minimum typing and type-checking in F ≤Mathematical Structures in Computer Science, 1992
- A semantic basis for QuestJournal of Functional Programming, 1991
- On understanding types, data abstraction, and polymorphismACM Computing Surveys, 1985
- A new type assignment for λ-termsArchive for Mathematical Logic, 1978
- A formulation of the simple theory of typesThe Journal of Symbolic Logic, 1940