Induction principles for type theories, internally to presheaf categories

02/23/2021
by   Rafaël Bocquet, et al.
0

We present new induction principles for the syntax of dependent type theories. These induction principles are expressed in the internal language of presheaf categories. This ensures for free that any construction is stable under substitution. In order to combine the internal languages of multiple presheaf categories, we use Dependent Right Adjoints and Multimodal Type Theory. Categorical gluing is used to prove these induction principles, but it not visible in their statements, which involve a notion of model without context extensions. We illustrate the derivation of these induction principles by the example of type theory with a hierarchy of universes closed under function space and natural numbers, but we expect that our method can be applied to any syntax with bindings. As example applications of these induction principles, we give short and boilerplate-free proofs of canonicity and normalization for our example type theory.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

11/25/2011

Principles of Solomonoff Induction and AIXI

We identify principles characterizing Solomonoff Induction by demands on...
09/03/2020

Internal ∞-Categorical Models of Dependent Type Theory: Towards 2LTT Eating HoTT

Using dependent type theory to formalise the syntax of dependent type th...
02/27/2021

Generalized Universe Hierarchies and First-Class Universe Levels

In type theories, universe hierarchies are commonly used to increase the...
03/24/2022

Unifying cubical and multimodal type theory

In this paper we combine the principled approach to programming with mod...
07/03/2011

Abstraction Super-structuring Normal Forms: Towards a Theory of Structural Induction

Induction is the process by which we obtain predictive laws or theories ...
09/27/2018

Induction rules in bounded arithmetic

We study variants of Buss's theories of bounded arithmetic axiomatized b...
07/05/2018

Formalisation in Constructive Type Theory of Barendregt's Variable Convention for Generic Structures with Binders

We introduce a universe of regular datatypes with variable binding infor...
This week in AI

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