Abstract:
We explore the design space for type systems with polymorphic records. We design record systems for extension, concatenation and removal of fields. Furthermore, we design a record system where field labels become first class values. That means, we can now quantify over field lables and pass them around as arguments. All designed record systems enjoy type inference with principal types. Especially, we can combine any features into a new record system retaining type inference with principal types. We also point out some problems which are present in previous record systems. Our designed record systems can be seen as the proper logical formulation of previous approaches with even more expressive power.
Citations
|
738
|
A machine-oriented logic based on the resolution principle
– Robinson
- 1965
|
|
217
|
Principal type schemes for functional programs
– Damas, Milner
- 1982
|
|
154
|
Operations on records
– Cardelli, Mitchell
- 1994
|
|
143
|
Complete type inference for simple objects
– Wand
- 1987
|
|
128
|
Typechecking records and variants in a natural extension of ML
– Remy
- 1989
|
|
115
|
Qualified types: Theory and practice
– Jones
- 1992
|
|
85
|
Cylindric Algebras
– Henkin, Monk, et al.
- 1971
|
|
67
|
A polymorphic record calculus and its compilation
– Ohori
- 1995
|
|
63
|
Type inference with constrained types. Theory and practice of object systems
– Odersky, Sulzmann, et al.
- 1999
|
|
56
|
A Polymporphic Type System for Extensible Records and Variants
– Gaster, Jones
- 1996
|
|
52
|
Equational term graph rewriting
– Ariola, Klop
- 1996
|
|
49
|
Coinductive axiomatization of recursive type equality and subtyping
– Brandt, Henglein
- 1997
|
|
40
|
Type inference with constrained types
– Sulzmann, Odersky, et al.
- 1997
|
|
32
|
Extending ML type system with a sorted equational theory
– R'emy
- 1992
|
|
7
|
Type inference and equational theories
– Kennedy
- 1996
|
|
6
|
A case study of typechecking with constrained types: Typing record concatenation. Presented at the workshop on advances in types for computer science at the Newton Institute
– Rémy
- 1995
|
|
3
|
Re subtyping and row variables for record types. Presented at the workshop on advances in types for computer science at the Newton Institute
– Remy
- 1995
|
|
2
|
on Foundations of Objectoriented programming Languages
– Workshop
- 1997
|
|
2
|
Type inference for recursivly constrainted types and its application to object oriented programming
– Eifrig, Smith, et al.
- 1995
|
