The RedPRL Proof Assistant (Invited Paper)

07/05/2018
by   Carlo Angiuli, et al.
0

RedPRL is an experimental proof assistant based on Cartesian cubical computational type theory, a new type theory for higher-dimensional constructions inspired by homotopy type theory. In the style of Nuprl, RedPRL users employ tactics to establish behavioral properties of cubical functional programs embodying the constructive content of proofs. Notably, RedPRL implements a two-level type theory, allowing an extensional, proof-irrelevant notion of exact equality to coexist with a higher-dimensional proof-relevant notion of paths.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
07/29/2021

Syllepsis in Homotopy Type Theory

It is well-known that in homotopy type theory (HoTT), one can prove the ...
research
12/13/2017

Axioms for Modelling Cubical Type Theory in a Topos

The homotopical approach to intensional type theory views proofs of equa...
research
09/26/2020

Effective Kan fibrations in simplicial sets

We introduce the notion of an effective Kan fibration, a new mathematica...
research
10/22/2018

Canonicity and normalisation for Dependent Type Theory

We show canonicity and normalization for dependent type theory with a cu...
research
07/29/2020

Towards a Homotopy Domain Theory (HoDT)

A favourable environment is proposed for the achievement of λ-models wit...
research
08/13/2018

The Delta-framework

We introduce the Delta-framework, LF-Delta, a dependent type theory base...

Please sign up or login with your details

Forgot password? Click here to reset