DeepAI AI Chat
Log In Sign Up

Computational Higher Type Theory III: Univalent Universes and Exact Equality

by   Carlo Angiuli, et al.

This is the third in a series of papers extending Martin-Löf's meaning explanations of dependent type theory to a Cartesian cubical realizability framework that accounts for higher-dimensional types. We extend this framework to include a cumulative hierarchy of univalent Kan universes of Kan types, exact equality and other pretypes lacking Kan structure, and a cumulative hierarchy of pretype universes. As in Parts I and II, the main result is a canonicity theorem stating that closed terms of boolean type evaluate to either true or false. This establishes the computational interpretation of Cartesian cubical higher type theory based on cubical programs equipped with a deterministic operational semantics.


page 1

page 2

page 3

page 4


Computational Higher Type Theory IV: Inductive Types

This is the fourth in a series of papers extending Martin-Löf's meaning ...

Game semantics of universes

This work extends the present author's computational game semantics of M...

Cubical informal type theory: the higher groupoid structure

Following a project of developing conventions and notations for informal...

Guarded Computational Type Theory

Nakano's later modality can be used to specify and define recursive func...

Game Semantics of Martin-Löf Type Theory

We present game semantics of Martin-Löf type theory (MLTT), which solves...

Canonicity and normalisation for Dependent Type Theory

We show canonicity and normalization for dependent type theory with a cu...

The encodability hierarchy for PCF types

Working with the simple types over a base type of natural numbers (inclu...