Extensionality in the calculus of constructions

Authors:
Nicolas Oury
Affiliations:
Laboratoire de Recherche en Informatique, UMR 8623 CNRS, Université Paris–Sud, Orsay, France
Venue:
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Year:
2005

Citing 4
Cited 8

Implementing mathematics with the Nuprl proof development system

Implementing mathematics with the Nuprl proof development system
ECC, and extended calculus of constructions

Proceedings of the Fourth Annual Symposium on Logic in computer science
Extensional Constructs in Intensional Type Theory

Extensional Constructs in Intensional Type Theory
The Calculus of algebraic Constructions

RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications

Observational equality, now!

PLPV '07 Proceedings of the 2007 workshop on Programming languages meets program verification
Nested Datatypes with Generalized Mendler Iteration: Map Fusion and the Example of the Representation of Untyped Lambda Calculus with Explicit Flattening

MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
An induction principle for nested datatypes in intensional type theory

Journal of Functional Programming
Coq modulo theory

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
A datastructure for iterated powers

MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Inductive consequences in the calculus of constructions

ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Extending Type Theory with Forcing

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Building decision procedures in the calculus of inductive constructions

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a method to translate a proof in an extensional version of the Calculus of Constructions into a proof in the Calculus of Inductive Constructions extended with a few axioms. We use a specific equality in order to translate the extensional conversion relation into an intensional system.