Normalization for Cubical Type Theory

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)(2021)

引用 50|浏览2
暂无评分
摘要
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 ...
更多
查看译文
关键词
Computer science,Syntactics
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要