Failure of Normalization in Impredicative Type Theory with Proof-Irrelevant Propositional Equality

11/19/2019
by   Andreas Abel, et al.
0

In type theory with an impredicative universe of propositions and a proof-irrelevant propositional equality the normalization property fails. Thus, type checking is likely undecidable. The counterexample to normalization is adapted from Girard's counterexample against normalization of System F equipped with a decider for type equality. It refutes Werner's normalization conjecture [LMCS 2008].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/27/2021

Normalization for Cubical Type Theory

We prove normalization for (univalent, Cartesian) cubical type theory, c...
research
02/01/2021

Quadratic type checking for objective type theory

We introduce a modification of standard Martin-Lof type theory in which ...
research
05/02/2022

Propositional Equality for Gradual Dependently Typed Programming

Gradual dependent types can help with the incremental adoption of depend...
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
05/24/2017

Properties of Normalization for a math based intermediate representation

The Normalization transformation plays a key role in the compilation of ...
research
07/17/2019

Shallow Embedding of Type Theory is Morally Correct

There are multiple ways to formalise the metatheory of type theory. For ...
research
06/24/2023

Towards Understanding Gradient Approximation in Equality Constrained Deep Declarative Networks

We explore conditions for when the gradient of a deep declarative node c...

Please sign up or login with your details

Forgot password? Click here to reset