DeepAI AI Chat
Log In Sign Up

The Integers as a Higher Inductive Type

by   Thorsten Altenkirch, et al.

We consider the problem of defining the integers in Homotopy Type Theory (HoTT). We can define the type of integers as signed natural numbers (i.e., using a coproduct), but its induction principle is very inconvenient to work with, since it leads to an explosion of cases. An alternative is to use set-quotients, but here we need to use set-truncation to avoid non-trivial higher equalities. This results in a recursion principle that only allows us to define function into sets (types satisfying UIP). In this paper we consider higher inductive types using either a small universe or bi-invertible maps. These types represent integers without explicit set-truncation that are equivalent to the usual coproduct representation. This is an interesting example since it shows how some coherence problems can be handled in HoTT. We discuss some open questions triggered by this work. The proofs have been formally verified using cubical Agda.


page 1

page 2

page 3

page 4


Free Higher Groups in Homotopy Type Theory

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

Coherence via Wellfoundedness

Homotopy type theory allows us to work with the higher-dimensional struc...

Computational Higher Type Theory IV: Inductive Types

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

A Cartesian Bicategory of Polynomial Functors in Homotopy Type Theory

Polynomial functors are a categorical generalization of the usual notion...

Efficient Mendler-Style Lambda-Encodings in Cedille

It is common to model inductive datatypes as least fixed points of funct...

Internalizing Representation Independence with Univalence

In their usual form, representation independence metatheorems provide an...

An Intuitionistic Set-theoretical Model of Fully Dependent CCω

Werner's set-theoretical model is one of the simplest models of CIC. It ...