Author:
Cardelli Luca,Mitchell John C.
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.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Cited by
56 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Structural Subtyping as Parametric Polymorphism;Proceedings of the ACM on Programming Languages;2023-10-16
2. A Calculus with Recursive Types, Record Concatenation and Subtyping;Programming Languages and Systems;2022
3. An ML-style Record Calculus with Extensible Records;Electronic Proceedings in Theoretical Computer Science;2021-12-29
4. Compositional Programming;ACM Transactions on Programming Languages and Systems;2021-09-30
5. Taming the Merge Operator;Journal of Functional Programming;2021