We define a simple collection of operations for creating and manipulating record structures, where records are intended as finite associations of values to labels. A second-order type system over these operations supports both subtyping and polymorphism. We provide typechecking algorithms and limited semantic models. Our approach unifies and extends previous notions of records, bounded quantification, record extension, and parametrization by row-variables. The general aim is to provide foundations for concepts found in object-oriented languages, within a framework based on typed lambda-calculus.
|
1292
|
The C++ Programming Language
– Stroustrup
- 1999
|
|
1219
|
Object-oriented Software Construction
– Meyer
- 1988
|
|
826
|
A theory of type polymorphism in programming
– Milner
- 1978
|
|
777
|
On understanding types, data abstraction, and polymorphism
– Cardelli, Wegner
- 1985
|
|
513
|
A semantics of multiple inheritance
– Cardelli
- 1988
|
|
231
|
Interprétation fonctionelle et élimination des coupures de l’arithmétique d’ordre supérieur
– Girard
- 1972
|
|
186
|
Une extension de l’interprétation de Gödel à l’analyse, et son application à l’élimination des coupures dans l’analyse et la théorie des types
– Girard
- 1971
|
|
149
|
Type systems for programming languages
– Mitchell
- 1990
|
|
146
|
Complete type inference for simple objects
– Wand
- 1987
|
|
138
|
Simula: An Algol-Based Simulation Language
– Dahl, Nygaard
|
|
131
|
Typechecking records and variants in a natural extension of ML
– Rémy
- 1989
|
|
122
|
Type inference for record concatenation and multiple inheritance
– Wand
- 1991
|
|
113
|
An Introduction to Trellis/Owl
– Schaffert, Cooper, et al.
- 1986
|
|
106
|
A modest model of records, inheritance, and bounded quantification
– Bruce, Longo
- 1990
|
|
84
|
Database Programming in Machiavelli, a Polymorphic Language with Static Type Inference
– Ohori, Buneman, et al.
- 1989
|
|
71
|
Coherence of subsumption, minimum typing and typechecking
– Curien, Ghelli
- 1985
|
|
69
|
Coercion and type inference
– Mitchell
- 1984
|
|
52
|
ML with extended pattern matching and subtypes
– Jategaonkar, Mitchell
- 1988
|
|
48
|
A type-inference approach to reduction properties and semantics of polymorphic expressions (summary
– Mitchell
- 1986
|
|
37
|
Inheritance and explicit coercion
– Breazu-Tannen, Coquand, et al.
- 1991
|
|
23
|
Coherence of Subsumption
– Curien, Ghelli
- 1992
|
|
21
|
Type inference in a database programming language
– Ohori, Buneman
- 1988
|
|
12
|
Interprtation fonctionelle et limination des coupures dans l'arithmtique d'ordre suprieur. Thse de doctorat d'tat
– Girard
- 1972
|
|
9
|
Typechecking records and variants in a natural extension of ml
– Rmy
- 1989
|
|
6
|
Towards a theory of type structure. Proc. Colloquium sur la programmation
– Reynolds
- 1974
|
|
6
|
Une extension de l'interprtation de Gdel l'analyse, et son application l'limination des coupures dans l'analyse et la thorie des types
– Girard
- 1971
|
|
4
|
The semantics of second order lambda calculus
– Bruce, Meyer, et al.
- 1990
|
|
3
|
Constructive natural deduction and its ‘ω-set’ interpretation
– Longo, Moggi
- 1991
|
|
2
|
Constructive natural deduction and its `w-set' interpretation
– Longo, Moggi
|
|
1
|
B.Kalsow, G.Nelson: Modula-3 report (revised
– Cardelli, Glassman
- 1989
|
|
1
|
G.Ghelli: Coherence ofsubsumption
– Curien
|
|
1
|
E.Moggi: Constructive natural deduction and its 'o&set
– Longo
- 1988
|
|
1
|
Typechecking records and variants in a natural extension of ML
– Rdmy
- 1989
|
|
1
|
E.Moggi: Constructive natural deduction and its ‘w-set
– Longo
- 1988
|
|
