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.
|
762
|
On understanding types, data abstraction, and polymorphism
– Cardelli, Wegner
- 1985
|
|
260
|
Proofs and Types
– Girard, Taylor, et al.
- 1989
|
|
182
|
Simple type-theoretic foundations for object-oriented programming
– Pierce, Turner
- 1994
|
|
164
|
A lambda calculus of objects and method specialization
– Fisher, Honsell, et al.
- 1994
|
|
154
|
Operations on records
– Cardelli, Mitchell
- 1994
|
|
146
|
A final coalgebra theorem
– Aczel, Mendler
- 1988
|
|
140
|
The categorytheoretic solution of recursive domain equations
– Smyth, Plotkin
- 1982
|
|
136
|
A paradigmatic object-oriented programming language: Design, static typing, and semantics
– Bruce
- 1994
|
|
120
|
Type inference for record concatenation and multiple inheritance
– Wand
- 1991
|
|
116
|
F-bounded polymorphism for object-oriented programming
– Canning, Cook, et al.
- 1989
|
|
116
|
R.Sethi: An ideal model for recursive polymorphic types
– MacQueen
- 1984
|
|
114
|
An extension of system F with subtyping
– Cardelli, Martini, et al.
- 1991
|
|
109
|
A logic for parametric polymorphism
– Plotkin, Abadi
- 1993
|
|
101
|
Toward a typed foundation for method specialization and inheritance
– Mitchell
- 1990
|
|
76
|
A theory of primitive objects: Untyped and first–order systems
– Abadi, Cardelli
- 1994
|
|
70
|
Coherence of subsumption, minimum typing and typechecking
– Curien, Ghelli
- 1992
|
|
66
|
A theory of primitive objects: Second–order systems
– Abadi, Cardelli
- 1994
|
|
66
|
Inheritance in smalltalk-80: a denotational definition
– Kamin
- 1988
|
|
62
|
A record calculus based on symmetric concatenation
– Harper, Pierce
- 1991
|
|
52
|
A per model of polymorphism and recursive types
– Abadi, Plotkin
- 1990
|
|
44
|
Recursion over realizability structures
– Amadio
- 1991
|
|
41
|
Baby Modula–3 and a Theory of Objects
– Abadi
- 1994
|
|
39
|
Extensible records in a pure calculus of subtyping
– Cardelli
- 1994
|
|
37
|
Inheritance and explicit coercion
– Breazu-Tannen, Coquand, et al.
- 1991
|
|
35
|
Relational semantics for recursive types and bounded quantification
– Cardone
- 1989
|
|
27
|
A Theory of Primitive Objects
– Abadi, Cardelli
- 1994
|
|
20
|
Computing with coercions
– Breazu-Tannen, Gunter, et al.
- 1990
|
|
3
|
Tipi ricorsivi e inheritance in linguaggi funzionali, Dipartimento di Informatica, Universit di
– Cardone
|
