Passer à la navigation principale Passer à la recherche Passer au contenu principal

The not so simple proof-irrelevant model of CC

  • INRIA Saclay, Laboratoire de Recherche en Informatique (LRI), Université Paris Sud
  • INRIA Rocquencourt

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collectionChapitreRevue par des pairs

Résumé

It is well-known that the Calculus of Constructions (CC) bears a simple set-theoretical model in which proof-terms are mapped onto a single object - a property which is known as proof-irrelevance. In this paper, we show that when going into the (generally omitted) technical details, this naive model raises several unexpected difficulties related to the interpretation of the impredicative level, especially for the soundness property which is surprisingly difficult to be given a correct proof in this simple framework. We propose a way to tackle these difficulties, thus giving a (more) detailed elementary consistency proof of CC without going back to a translation to Fω. We also discuss some possible alternatives and possible extensions of our construction.

langue originaleAnglais
titreLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
rédacteurs en chefHerman Geuvers, Freek Wiedijk
EditeurSpringer Verlag
Pages240-258
Nombre de pages19
ISBN (imprimé)354014031X
Les DOIs
étatPublié - 1 janv. 2003
Modification externeOui

Série de publications

NomLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2646
ISSN (imprimé)0302-9743
ISSN (Electronique)1611-3349

Empreinte digitale

Examiner les sujets de recherche de « The not so simple proof-irrelevant model of CC ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation