Skip to main navigation Skip to search Skip to main content

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)

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationFifth Ifip International Conference On Theoretical Computer Science - Tcs 2008
PublisherSpringer New York
Pages349-365
Number of pages17
ISBN (Print)9780387096797
DOIs
Publication statusPublished - 1 Jan 2008

Publication series

NameIFIP International Federation for Information Processing
Volume273
ISSN (Print)1571-5736

Fingerprint

Dive into the research topics of 'From formal proofs to mathematical proofs: A safe, incremental way for building in first-order decision procedures'. Together they form a unique fingerprint.

Cite this