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

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.
Document type :
Conference papers
5th IFIP International Conference on Theoretical Computer Science - TCS 2008, Sep 2008, Milan, Italy. 273, 2008, IFIP. <10.1007/978-0-387-09680-3_24>


https://hal.inria.fr/inria-00275382
Contributor : Frédéric Blanqui <>
Submitted on : Wednesday, April 23, 2008 - 3:41:08 PM
Last modification on : Monday, June 6, 2011 - 2:34:16 PM

Files

main.pdf
fileSource_public_author

Identifiers

Collections

Citation

Frédéric Blanqui, Jean-Pierre Jouannaud, Pierre-Yves Strub. From formal proofs to mathematical proofs: a safe, incremental way for building in first-order decision procedures. 5th IFIP International Conference on Theoretical Computer Science - TCS 2008, Sep 2008, Milan, Italy. 273, 2008, IFIP. <10.1007/978-0-387-09680-3_24>. <inria-00275382>

Export

Share

Metrics

Consultation de
la notice

173

Téléchargement du document

62