Computational Higher Type Theory III: Univalent Universes and Exact Equality

12/05/2017
by   Carlo Angiuli, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

01/04/2018

Computational Higher Type Theory IV: Inductive Types

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

Game semantics of universes

This work extends the present author's computational game semantics of M...
04/24/2018

Guarded Computational Type Theory

Nakano's later modality can be used to specify and define recursive func...
06/22/2018

Cubical informal type theory: the higher groupoid structure

Following a project of developing conventions and notations for informal...
04/18/2019

Cubical Syntax for Reflection-Free Extensional Equality

We contribute XTT, a cubical reconstruction of Observational Type Theory...
05/22/2020

Internal Parametricity for Cubical Type Theory

We define a computational type theory combining the contentful equality ...
05/03/2019

Game Semantics of Martin-Löf Type Theory

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

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.