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

Frédéric Blanqui 1, 2 Jean-Pierre Jouannaud 3, 4 Pierre-Yves Strub 3, 4
1 FORMES - Formal Methods for Embedded Systems
LIAMA - Laboratoire Franco-Chinois d'Informatique, d'Automatique et de Mathématiques Appliquées, Inria Paris-Rocquencourt
2 PAREO - Formal islands: foundations and applications
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
3 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
4 TYPICAL - Types, Logic and computing
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], CNRS - Centre National de la Recherche Scientifique : UMR, Polytechnique - X
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.
Keywords : proof assistants proof lambda-calculus calculus of constructions certification decision procedures first-order theory type theory
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 : Wednesday, May 18, 2016 - 8:55:13 AM
Document(s) archivé(s) le : Friday, May 28, 2010 - 5:23:09 PM

Files

main.pdf
Files produced by the author(s)

Identifiers

Collections

INRIA | LIX | LIAMA | X-LIX | X-DEP-INFO | X | PARISTECH | INRA | CIRAD | UNIV-LORRAINE

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

BibTeX | XML | endNote

Share

Metrics

Record views

317

Document downloads

114

Contact


archive-ouverte@inria.fr