Typal Heterogeneous Equality Types

07/17/2019
by   Andrew M. Pitts, et al.
0

The usual homogeneous form of equality type in Martin-Löf Type Theory contains identifications between elements of the same type. By contrast, the heterogeneous form of equality contains identifications between elements of possibly different types. This paper introduces a simple set of axioms for such types. The axioms are equivalent to the combination of systematic elimination rules for both forms of equality, albeit with typal (also known as "propositional") computation properties, together with Streicher's Axiom K, or equivalently, the principle of uniqueness of identity proofs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/18/2019

Cubical Syntax for Reflection-Free Extensional Equality

We contribute XTT, a cubical reconstruction of Observational Type Theory...
research
01/25/2019

Calculational HoTT

Based on a loose correspondence between, on one hand, a first order vers...
research
08/05/2020

Extensional equality preservation and verified generic programming

In verified generic programming, one cannot exploit the structure of con...
research
06/01/2018

The encodability hierarchy for PCF types

Working with the simple types over a base type of natural numbers (inclu...
research
02/10/2021

An Algebra of Properties of Binary Relations

We consider all 16 unary operations that, given a homogeneous binary rel...
research
10/30/2017

The univalence axiom in cubical sets

In this note we show that Voevodsky's univalence axiom holds in the mode...
research
04/26/2021

Bijective proofs for Eulerian numbers in types B and D

Let ⟨n k⟩, ⟨B_n k⟩, and ⟨D_n k⟩ be the Eulerian numbers in the types A, ...

Please sign up or login with your details

Forgot password? Click here to reset