Skip to Main content Skip to Navigation

Vers une certification de l'extraction de Coq

Abstract : The Coq proof assistant mechanically checks the consistency of the logical reasoning in a proof. It can also be used to develop certified programs. Indeed, Coq uses internally a typed language derived from λ-calculus, the calculus of inductive constructions (CIC). This language can be directly used by a programmer, and a procedure — extraction — allows one to translate CIC programs into more widely used languages such as OCaml, Haskell or Scheme. Extraction is not a mere syntax change: the type system of CIC is very rich, but purely logical entities can appear inside programs, impacting their performance. Extraction erases these logical artefacts as well. In this thesis, we tackle certification of the extraction itself. We have proved its correction in the context of a full formalization of Coq in Coq. Even though this formalization is not exactly Coq, we worked on it with the concrete implementation of Coq in mind. We also propose a new way to certify extracted programs, in the concrete setting of the existing Coq system.
Complete list of metadatas

Cited literature [46 references]  Display  Hide  Download
Contributor : Stéphane Glondu <>
Submitted on : Wednesday, May 23, 2018 - 1:41:08 PM
Last modification on : Tuesday, October 20, 2020 - 11:02:27 AM
Long-term archiving on: : Friday, August 24, 2018 - 8:50:45 PM


Files produced by the author(s)


  • HAL Id : tel-01798332, version 1



Stéphane Glondu. Vers une certification de l'extraction de Coq. Logique en informatique [cs.LO]. Université Paris Diderot, 2012. Français. ⟨tel-01798332⟩



Record views


Files downloads