Canonicity and normalisation for Dependent Type Theory

10/22/2018
by   Thierry Coquand, et al.
0

We show canonicity and normalization for dependent type theory with a cumulative sequence of universes and a type of Boolean. The argument follows the usual notion of reducibility, going back to Godel's Dialectica interpretation and the work of Tait. A key feature of our approach is the use of a proof relevant notion of reducibility.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/14/2020

Isabelle/Spartan – A Dependent Type Theory Framework for Isabelle

This paper introduces Isabelle/Spartan, an implementation of intensional...
research
08/16/2023

A topological counterpart of well-founded trees in dependent type theory

Within dependent type theory, we provide a topological counterpart of we...
research
07/05/2018

The RedPRL Proof Assistant (Invited Paper)

RedPRL is an experimental proof assistant based on Cartesian cubical com...
research
05/17/2018

Presheaf Models of Relational Modalities in Dependent Type Theory

This report is an extension of 'A Model of Parametric Dependent Type The...
research
03/07/2021

Reduction Free Normalisation for a proof irrelevant type of propositions

We show normalisation and decidability of convertibility for a type theo...
research
06/02/2021

Normalization for multimodal type theory

We consider the conversion problem for multimodal type theory (MTT) by c...
research
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...

Please sign up or login with your details

Forgot password? Click here to reset