Generic Programming with Extensible Data Types: Or, Making Ad Hoc Extensible Data Types Less Ad Hoc

6Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

We present a novel approach to generic programming over extensible data types. Row types capture the structure of records and variants, and can be used to express record and variant subtyping, record extension, and modular composition of case branches. We extend row typing to capture generic programming over rows themselves, capturing patterns including lifting operations to records and variations from their component types, and the duality between cases blocks over variants and records of labeled functions, without placing specific requirements on the fields or constructors present in the records and variants. We formalize our approach in System R, an extension of F with row types, and give a denotational semantics for (stratified) R in Agda.

Cite

CITATION STYLE

APA

Hubers, A., & Morris, J. G. (2023). Generic Programming with Extensible Data Types: Or, Making Ad Hoc Extensible Data Types Less Ad Hoc. In Proceedings of the ACM on Programming Languages (Vol. 7). Association for Computing Machinery. https://doi.org/10.1145/3607843

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free