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

From formal proofs to mathematical proofs: A safe, incremental way for building in first-order decision procedures

  • LORIA Laboratoire Lorrain de Recherche en Informatique et ses Applications
  • Laboratoire d'Informatique (LIX)

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collectionContribution à une conférenceRevue par des pairs

6 Citations (Scopus)

Résumé

We investigate here a new version of the Calculus of Inductive Constructions (CIC) on which the proof assistant Coq is based: the Calculus of Congruent Inductive Constructions, which truly extends CIC by building in arbitrary first-order decision procedures: deduction is still in charge of the CIC kernel, while computation is outsourced to dedicated first-order decision procedures that can be taken from the shelves provided they deliver a proof certificate. The soundness of the whole system becomes an incremental property following from the soundness of the certificate checkers and that of the kernel. A detailed example shows that the resulting style of proofs becomes closer to that of the working mathematician.

langue originaleAnglais
titreFifth Ifip International Conference On Theoretical Computer Science - Tcs 2008
EditeurSpringer New York
Pages349-365
Nombre de pages17
ISBN (imprimé)9780387096797
Les DOIs
étatPublié - 1 janv. 2008

Série de publications

NomIFIP International Federation for Information Processing
Volume273
ISSN (imprimé)1571-5736

Empreinte digitale

Examiner les sujets de recherche de « From formal proofs to mathematical proofs: A safe, incremental way for building in first-order decision procedures ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation