Normalization for Cubical Type Theory

We prove normalization for (univalent, Cartesian) cubical type theory, closing the last major open problem in the syntactic metatheory of cubical type theory. Our normalization result is reduction-free, in the sense of yielding a bijection between equivalence classes of terms in context and a tracta...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 1 - 15
Main Authors: Sterling, Jonathan, Angiuli, Carlo
Format: Conference Proceeding
Language:English
Published: IEEE 29.06.2021
Subjects:
Computer science
Syntactics
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We prove normalization for (univalent, Cartesian) cubical type theory, closing the last major open problem in the syntactic metatheory of cubical type theory. Our normalization result is reduction-free, in the sense of yielding a bijection between equivalence classes of terms in context and a tractable language of β/η-normal forms. As corollaries we obtain both decidability of judgmental equality and the injectivity of type constructors.
DOI:10.1109/LICS52264.2021.9470719