Computational Higher Type Theory IV: Inductive Types

01/04/2018
by   Evan Cavallo, et al.
0

This is the fourth in a series of papers extending Martin-Löf's meaning explanation of dependent type theory to higher-dimensional types. In this installment, we show how to define cubical type systems supporting a general schema of cubical inductive types, inductive types whose constructors may take dimension parameters and may have specified boundaries. Using this schema, we are able to specify and implement many of the higher inductive types which have been postulated in homotopy type theory, including homotopy pushouts, the torus, W-quotients, truncations, and arbitrary localizations. We also construct one indexed inductive type, the fiber family of a term. Using the fiber family, it is possible to define an identity type whose eliminator satisfies an exact computation rule on the reflexivity constructor. We believe that the techniques used to construct the fiber family could be straightforwardly combined with our schema for inductive types in order to give a schema for indexed cubical inductive types. The addition of higher inductive types and identity types makes computational higher type theory a model of homotopy type theory, capable of interpreting almost all of the constructions in the HoTT Book (with the exception of general indexed inductive types and inductive-inductive types). This is the first such model with an explicit canonicity theorem stating that all closed terms of boolean type evaluate either to true or to false.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

02/08/2018

Impredicative Encodings of (Higher) Inductive Types

Postulating an impredicative universe in dependent type theory allows Sy...
12/05/2017

Computational Higher Type Theory III: Univalent Universes and Exact Equality

This is the third in a series of papers extending Martin-Löf's meaning e...
12/11/2002

Types of Cost in Inductive Concept Learning

Inductive concept learning is the task of learning to assign cases to a ...
08/24/2018

Code Generation for Higher Inductive Types

Higher inductive types are inductive types that include nontrivial highe...
05/18/2021

Parametricity and Semi-Cubical Types

We construct a model of type theory enjoying parametricity from an arbit...
07/01/2020

The Integers as a Higher Inductive Type

We consider the problem of defining the integers in Homotopy Type Theory...
05/05/2018

Free Higher Groups in Homotopy Type Theory

Given a type A in homotopy type theory (HoTT), we can define the free in...
This week in AI

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