Skip to Main content Skip to Navigation

Extraction de code fonctionnel certifié à partir de spécifications inductives

Abstract : Proof assistants based on type theory allow the user to adopt either a functional style, or a relational style (e.g., by using inductive types). Both styles have advantages and drawbacks. Relational style may be preferred because it allows the user to describe only what is true, discard momentarily the termination question, and stick to a rule-based description. However, a relational specification is usually not executable.We propose a general framework to turn an inductive specification into a functional one, by extracting a function from the former and eventually produce the proof of soundness of the extracted function w.r.t. its inductive specification. In addition, using user-defined modes which label inputs and outputs, we are able to extract several computational contents from a single inductive type.We also provide two implementations of our approach, one in the Coq proof assistant and the other in the Focalize environnement. Both are currently distributed with the respective tools.
Document type :
Complete list of metadata

Cited literature [91 references]  Display  Hide  Download
Contributor : ABES STAR :  Contact
Submitted on : Tuesday, April 1, 2014 - 11:40:55 AM
Last modification on : Wednesday, September 28, 2022 - 5:52:16 AM
Long-term archiving on: : Tuesday, July 1, 2014 - 11:16:19 AM


Version validated by the jury (STAR)


  • HAL Id : tel-00968607, version 1



Pierre-Nicolas Tollitte. Extraction de code fonctionnel certifié à partir de spécifications inductives. Informatique et langage [cs.CL]. Conservatoire national des arts et metiers - CNAM, 2013. Français. ⟨NNT : 2013CNAM0895⟩. ⟨tel-00968607⟩



Record views


Files downloads