An extension of system F with subtyping
- 1 January 1991
- book chapter
- Published by Springer Nature
- p. 750-770
- https://doi.org/10.1007/3-540-54415-1_73
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Operations on recordsMathematical Structures in Computer Science, 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
- Functorial polymorphismTheoretical Computer Science, 1990
- Typed lambda models and Cartesian closed categories (preliminary version)Contemporary Mathematics, 1989
- A semantics of multiple inheritanceInformation and Computation, 1988
- Polymorphism is set theoretic, constructivelyPublished by Springer Nature ,1987
- Automatic synthesis of typed Λ-programs on term algebrasTheoretical Computer Science, 1985
- On understanding types, data abstraction, and polymorphismACM Computing Surveys, 1985
- Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theoremIndagationes Mathematicae, 1972