Recursive types are not conservative over F≤
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 146-162
- https://doi.org/10.1007/bfb0037104
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Coherence of subsumption, minimum typing and type-checking in F ≤Mathematical Structures in Computer Science, 1992
- Bounded quantification is undecidablePublished by Association for Computing Machinery (ACM) ,1992
- Subtyping recursive typesPublished by Association for Computing Machinery (ACM) ,1991
- A modest model of records, inheritance, and bounded quantificationInformation and Computation, 1990
- A semantic basis for questPublished by Association for Computing Machinery (ACM) ,1990
- On understanding types, data abstraction, and polymorphismACM Computing Surveys, 1985