Row polymorphism

In programming language type theory, row polymorphism is a kind of polymorphism that allows one to write programs that are polymorphic on row types such as record types and polymorphic variants. ^[1] A row-polymorphic type system and proof of type inference was introduced by Mitchell Wand. ^{[2] [3]}

Row-polymorphic record type definition

The row-polymorphic record type defines a list of fields with their corresponding types, a list of missing fields, and a variable indicating the absence or presence of arbitrary additional fields. Both lists are optional, and the variable may be constrained. Specifically, the variable may be 'empty', indicating that no additional fields may be present for the record.

It may be written as ${\displaystyle \{\ell _{1}:T_{1},\dots ,\ell _{n}:T_{n},{\text{absent}}(f_{1}),\dots ,{\text{absent}}(f_{m}),\rho \}}$. This indicates a record type that has fields ${\displaystyle \ell _{i}}$ with respective types of ${\displaystyle T_{i}}$ (for ${\displaystyle i=1\dots n}$), and does not have any of the fields ${\displaystyle f_{j}}$ (for ${\displaystyle j=1\dots m}$), while ${\displaystyle \rho }$ expresses the fact the record may contain other fields than ${\displaystyle \ell _{i}}$.

Row-polymorphic record types allow us to write programs that operate only on a section of a record. For example, one may define a function that performs some two-dimensional transformation that accepts a record with two or more coordinates, and returns an identical type:

${\displaystyle {\text{transform2d}}:\{x:{\text{Number}},y:{\text{Number}},\rho \}\to \{x:{\text{Number}},y:{\text{Number}},\rho \}}$

Thanks to row polymorphism, the function may perform two-dimensional transformation on a three-dimensional (in fact, n-dimensional) point, leaving the z coordinate (or any other coordinates) intact. In a more general sense, the function can perform on any record that contains the fields ${\displaystyle x}$ and ${\displaystyle y}$ with type ${\displaystyle {\text{Number}}}$. There is no loss of information: the type ensures that all the fields represented by the variable ${\displaystyle \rho }$ are present in the return type. In contrast, the type definition ${\displaystyle \{x:{\text{Number}},y:{\text{Number}},\mathbf {empty} \}}$ expresses the fact that a record of that type has exactly the ${\displaystyle x}$ and ${\displaystyle y}$ fields and nothing else. In this case, a classic record type is obtained.

Typing operations on records

The record operations of selecting a field ${\displaystyle r.\ell }$, adding a field ${\displaystyle r[\ell$ :=e]}, and removing a field ${\displaystyle r\backslash \ell }$ can be given row-polymorphic types.

${\displaystyle \mathrm {select_{\ell }} =\lambda r.(r.\ell )\;:\;\{\ell :T,\rho \}\rightarrow T}$

${\displaystyle \mathrm {add_{\ell }} =\lambda r.\lambda e.r[\ell$ :=e]\;:\;\{\mathrm {absent} (\ell ),\rho \}\rightarrow T\rightarrow \{\ell :T,\rho \}}

${\displaystyle \mathrm {remove_{\ell }} =\lambda r.r\backslash \ell \;:\;\{\ell :T,\rho \}\rightarrow \{\mathrm {absent} (\ell ),\rho \}}$

Notes

1. "OCaml - Polymorphic variants". v2.ocaml.org. Retrieved 2022-12-03.
2. Wand, Mitchell (June 1989). "Type inference for record concatenation and multiple inheritance". Proceedings. Fourth Annual Symposium on Logic in Computer Science. pp. 92–97. doi:10.1109/LICS.1989.39162.
3. Wand, Mitchell (1991). "Type inference for record concatenation and multiple inheritance". Information and Computation. 93 (Selections from 1989 IEEE Symposium on Logic in Computer Science): 1–15. doi:10.1016/0890-5401(91)90050-C. ISSN   0890-5401.