Show simple item record

dc.contributor.authorMorris, J. Garrett
dc.contributor.authorMcKinna, James
dc.date.accessioned2021-02-08T23:28:01Z
dc.date.available2021-02-08T23:28:01Z
dc.date.issued2019-01
dc.identifier.citationJ. Garrett Morris and James McKinna. 2019. Abstracting extensible data types: Or, rows by any other name. Proc. ACM Program. Lang. 3, POPL, Article 12 (January 2019), 28 pages. DOI:https://doi.org/10.1145/3290325en_US
dc.identifier.urihttp://hdl.handle.net/1808/31398
dc.descriptionThis work is licensed under a Creative Commons Attribution 4.0 International License.en_US
dc.description.abstractWe present a novel typed language for extensible data types, generalizing and abstracting existing systems of row types and row polymorphism. Extensible data types are a powerful addition to traditional functional programming languages, capturing ideas from OOP-like record extension and polymorphism to modular compositional interpreters. We introduce row theories, a monoidal generalization of row types, giving a general account of record concatenation and projection (dually, variant injection and branching). We realize them via qualified types, abstracting the interpretation of records and variants over different row theories. Our approach naturally types terms untypable in other systems of extensible data types, while maintaining strong metatheoretic properties, such as coherence and principal types. Evidence for type qualifiers has computational content, determining the implementation of record and variant operations; we demonstrate this in giving a modular translation from our calculus, instantiated with various row theories, to polymorphic λ-calculus.en_US
dc.publisherAssociation for Computing Machinery (ACM)en_US
dc.rightsCopyright © 2019 Owner/Author.en_US
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/en_US
dc.titleAbstracting extensible data types: Or, rows by any other nameen_US
dc.typeArticleen_US
kusw.kuauthorMorris, J. Garrett
kusw.kudepartmentElectrical Engineering & Computer Scienceen_US
dc.identifier.doi10.1145/3290325en_US
kusw.oaversionScholarly/refereed, publisher versionen_US
kusw.oapolicyThis item meets KU Open Access policy criteria.en_US
dc.rights.accessrightsopenAccessen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Copyright © 2019 Owner/Author.
Except where otherwise noted, this item's license is described as: Copyright © 2019 Owner/Author.