A Record Calculus Based on Symmetric Concatenation
Abstract
Type systems for operations on extensible records form sumpt ion; we argue that the resulting system is more straightforward than subsumption-based alternatives.
Related papers
- Typing Record Concatenation for Free POPL 1992
- A Calculus with Recursive Types, Record Concatenation and Subtyping APLAS 2022
- Taming the Merge Operator JFP 2021
- Abstracting extensible data types: or, rows by any other name POPL 2019
- Type inference, principal typings, and let-polymorphism for first-class mixin modules ICFP 2005
- Formal proofs of transcendence for e and pi as an application of multivariate and symmetric polynomials CPP 2016
- Environments as First Class Objects POPL 1987
- Typing Records, Maps, and Structs ICFP 2023