Guarded Cubical Type Theory
Lars Birkedal, Ale\v{s} Bizjak, Ranald Clouston, Hans Bugge Grathwohl,, Bas Spitters, Andrea Vezzosi

TL;DR
This paper introduces guarded cubical type theory (GCTT), combining guarded dependent type theory with cubical type theory to support extensionality, recursive types, and decidable type checking, with formal semantics and practical examples.
Contribution
It develops GCTT, a new type theory integrating guarded recursion with cubical type theory, enabling reasoning about recursive types with extensionality and decidable type checking.
Findings
GCTT supports extensionality for guarded recursive types.
Prototype type-checker successfully verifies examples.
Semantics established in presheaf categories.
Abstract
This paper improves the treatment of equality in guarded dependent type theory (GDTT), by combining it with cubical type theory (CTT). GDTT is an extensional type theory with guarded recursive types, which are useful for building models of program logics, and for programming and reasoning with coinductive types. We wish to implement GDTT with decidable type checking, while still supporting non-trivial equality proofs that reason about the extensions of guarded recursive constructions. CTT is a variation of Martin-L\"of type theory in which the identity type is replaced by abstract paths between terms. CTT provides a computational interpretation of functional extensionality, enjoys canonicity for the natural numbers type, and is conjectured to support decidable type-checking. Our new type theory, guarded cubical type theory (GCTT), provides a computational interpretation of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
