A semantics of object types
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 332-341
- https://doi.org/10.1109/lics.1994.316056
Abstract
We give a semantics for a typed object calculus, an extension of System F with object subsumption and method override. We interpret the calculus in a per model, proving the soundness of both typing and equational rules. This semantics suggests a syntactic translation from our calculus into a simpler calculus with neither subtyping nor objects.Keywords
This publication has 23 references indexed in Scilit:
- Type inference for record concatenation and multiple inheritancePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A paradigmatic object-oriented programming language: Design, static typing and semanticsJournal of Functional Programming, 1994
- A theory of primitive objectsPublished by Springer Nature ,1994
- Coherence of subsumption, minimum typing and type-checking in F ≤Mathematical Structures in Computer Science, 1992
- Operations on recordsMathematical Structures in Computer Science, 1991
- An extension of system F with subtypingPublished by Springer Nature ,1991
- Relational semantics for recursive types and bounded quantificationPublished by Springer Nature ,1989
- F-bounded polymorphism for object-oriented programmingPublished by Association for Computing Machinery (ACM) ,1989
- On understanding types, data abstraction, and polymorphismACM Computing Surveys, 1985
- The Category-Theoretic Solution of Recursive Domain EquationsSIAM Journal on Computing, 1982