HackerPapers

arXiv:1611.02108cs.LO

Cubical Type Theory: a constructive interpretation of the univalence axiom

Cyril Cohen, Thierry Coquand, Simon Huber, Anders Mörtberg

Abstract

This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways to reason about identity types, for instance, function extensionality is directly provable in the system. Further, Voevodsky's univalence axiom is provable in this system. We also explain an extension with some higher inductive types like the circle and propositional truncation. Finally we provide semantics for this cubical type theory in a constructive meta-theory.

arXiv comments
To be published in the post-proceedings of the 21st International Conference on Types for Proofs and Programs, TYPES 2015
Journal reference
DOI
Subjects
cs.LOLogic in Computer Science math.LOLogic

On Hacker News

Linked by 2 identifiable commenters in 2 comments across 2 threads, from Oct 2017 to Jul 2019.

Comments linking this paper, per year.

Discussed in comments2 threads

    • One exciting new development is "Cubical Type Theory: a constructive interpretation of the univalence axiom" [0], a constructive version of homotopy type theory. The "axiom of choice" in this context is not really an axiom, just a provable theorem whose proof in this setting is…

      mauriciocView on HNParent context

    • Cubical https://github.com/mortberg/cubicaltt is a proof of concept programming language based on constructive (cubical type theory https://arxiv.org/abs/1611.02108) interpretation of HoTT. Agda also added recently support for cubical paths…

      hikerView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.