Coq en Coq - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1996

Coq en Coq


The essential step of the formal verification of a proof-checker such as Coq is the verification of its kernel: a type-checker for the Calculus of Inductive Constructions (CIC) which is its underlying formalism. The present work is a first small-scale attempt on a significative fragment of CIC: the Calculus of Constructions (CC). We formalize the definition and the metatheory of (CC) in Coq. In particular, we prove strong normalization and decidability of type inference. From the latter proof, we extract a certified Caml Light program, which performs type inference (or type-checking) for an arbitrary typing judgement in CC. Integrating this program in a larger system, including a parser and pretty-printer, we obtain a stand-alone proof-checker, called CoC, for the Calculus of Constructions. As an example, the formal proof of Newman's lemma, build with Coq, can be re-verified by CoC with reasonable performance.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3026.pdf (823.15 Ko) Télécharger le fichier

Dates and versions

inria-00073667 , version 1 (24-05-2006)


  • HAL Id : inria-00073667 , version 1


Bruno Barras. Coq en Coq. [Research Report] RR-3026, INRIA. 1996. ⟨inria-00073667⟩
393 View
327 Download


Gmail Facebook Twitter LinkedIn More