DeepAI
Log In Sign Up

Consistency of the Predicative Calculus of Cumulative Inductive Constructions (pCuIC)

10/11/2017
by   Amin Timany, et al.
0

In order to avoid well-know paradoxes associated with self-referential definitions, higher-order dependent type theories stratify the theory using a countably infinite hierarchy of universes (also known as sorts), Type_0 : Type_1 : ... . Such type systems are called cumulative if for any type A we have that A : Type_i implies A : Type_i+1. The predicative calculus of inductive constructions (pCIC) which forms the basis of the Coq proof assistant, is one such system. In this paper we present and establish the soundness of the predicative calculus of cumulative inductive constructions (pCuIC) which extends the cumulativity relation to inductive types.

READ FULL TEXT

page 1

page 2

page 3

page 4

07/16/2021

Touring the MetaCoq Project (Invited Paper)

Proof assistants are getting more widespread use in research and industr...
11/20/2020

Gradualizing the Calculus of Inductive Constructions

Acknowledging the ordeal of a fully formal development in a proof assist...
04/06/2022

Modular pre-processing for automated reasoning in dependent type theory

The power of modern automated theorem provers can be put at the service ...
02/12/2021

Complete Bidirectional Typing for the Calculus of Inductive Constructions

This article presents a bidirectional type system for the Calculus of In...
09/08/2020

On principal types and well-foundedness of terms in ECC

When we investigate a type system, it is helpful if we can establish the...
01/15/2020

Circular Proofs in First-Order Linear Logic with Least and Greatest Fixed Points

Inductive and coinductive structures are everywhere in mathematics and c...
12/11/2019

Practical Sized Typing for Coq

Termination of recursive functions and productivity of corecursive funct...