Operations on records

4 March 1991

journal article
research article
Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science

Vol. 1 (1) , 3-48
https://doi.org/10.1017/s0960129500000049

Abstract

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.

Keywords

This publication has 16 references indexed in Scilit:

A theory of type polymorphism in programming
Published by Elsevier ,2003
A modest model of records, inheritance and bounded quantification
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
The semantics of second-order lambda calculus
Information and Computation, 1990
Coherence of subsumption
Published by Springer Nature ,1990
Database programming in Machiavelli---a polymorphic language with static type inference
Published by Association for Computing Machinery (ACM) ,1989
A semantics of multiple inheritance
Information and Computation, 1988
On understanding types, data abstraction, and polymorphism
ACM Computing Surveys, 1985
Towards a theory of type structure
Lecture Notes in Computer Science, 1974
Une Extension De ĽInterpretation De Gödel a ĽAnalyse, Et Son Application a ĽElimination Des Coupures Dans ĽAnalyse Et La Theorie Des Types
Published by Elsevier ,1971
SIMULA: an ALGOL-based simulation language
Communications of the ACM, 1966