Correct and Complete Type Checking and Certified Erasure for Coq, in Coq

is built around a well-delimited kernel that performs type checking for definitions in a variant of the Calculus of Inductive Constructions ( ). Although the metatheory of is very stable and reliable, the correctness of its implementation in is less clear. Indeed, implementing an efficient type checker for is a rather complex task, and many parts of the code rely on implicit invariants which can easily be broken by further evolution of the code. Therefore, on average, one critical bug has been found every year in . This paper presents the first implementation of a type checker for the kernel of (without the module system, template polymorphism and η -conversion), which is proven sound and complete in with respect to its formal specification. Note that because of Gödel’s second incompleteness theorem, there is no hope to prove completely the soundness of the specification of inside (in particular strong normalization), but it is possible to prove the correctness and completeness of the implementation assuming soundness of the specification, thus moving from a trusted code base (TCB) to a trusted theory base (TTB) paradigm. Our work is based on the project which provides meta-programming facilities to work with terms and declarations at the level of the kernel. We verify a relatively efficient type checker based on the specification of the typing relation of the Polymorphic, Cumulative Calculus of Inductive Constructions ( ) at the basis of . It is worth mentioning that during the verification process, we have found a source of incompleteness in ’s official type checker, which has then been fixed in 8.14 thanks to our work. In addition to the kernel implementation, another essential feature of is the so-called extraction mechanism: the production of executable code in functional languages from definitions. We present a verified version of this subtle type and proof erasure step, therefore enabling the verified extraction of a safe type checker for in the future.