From Reversible Programs to Univalent Universes and Back

Simple item page
dc.contributor.authorCarette, Jacques
dc.contributor.authorChen, Chao-Hong
dc.contributor.authorChoudhury, Vikraman
dc.contributor.authorSabry, Amr A.
dc.date.accessioned2025-02-20T16:02:32Z
dc.date.available2025-02-20T16:02:32Z
dc.date.issued2018-04-16
dc.description.abstractWe establish a close connection between a reversible programming language based on type isomorphisms and a formally presented univalent universe. The correspondence relates combinators witnessing type isomorphisms in the programming language to paths in the univalent universe; and combinator optimizations in the programming language to 2-paths in the univalent universe. The result suggests a simple computational interpretation of paths and of univalence in terms of familiar programming constructs whenever the universe in question is computable.
dc.identifier.citationCarette, Jacques, et al. "From Reversible Programs to Univalent Universes and Back." Electronic Notes in Theoretical Computer Science, vol. 336, pp. 43610, 2018-4-16, https://doi.org/10.1016/j.entcs.2018.03.013.
dc.identifier.otherBRITE 3709
dc.identifier.urihttps://hdl.handle.net/2022/30527
dc.language.isoen
dc.relation.isversionofhttps://doi.org/10.1016/j.entcs.2018.03.013
dc.relation.isversionofhttps://doi.org/10.1016/j.entcs.2018.03.013
dc.relation.journalElectronic Notes in Theoretical Computer Science
dc.rightsThis work may be protected by copyright unless otherwise stated.
dc.titleFrom Reversible Programs to Univalent Universes and Back

Files

Collections

Faculty Open Access Articles
Can’t use the file because of accessibility barriers? Contact us