Find a copy online
Links to this item
Find a copy in the library
Finding libraries that hold this item...
Details
Genre/Form: | Thèses et écrits académiques |
---|---|
Material Type: | Document, Thesis/dissertation, Internet resource |
Document Type: | Internet Resource, Computer File |
All Authors / Contributors: |
Pierre-Nicolas Tollitte; Catherine Dubois, informaticienne).; David Delahaye; Xavier Leroy, chercheur en informatique).; Pierre Letouzey; Vlad Rusu, informaticien).; Hugo Herbelin; Mathieu Jaume; Conservatoire national des arts et métiers (France).; École doctorale Informatique, télécommunications et électronique de Paris.; Centre d'études et de recherche en informatique et communications (Paris). |
OCLC Number: | 875256174 |
Notes: | Titre provenant de l'écran-titre. |
Description: | 1 online resource |
Responsibility: | Pierre-Nicolas Tollitte ; sous la direction de Catherine Dubois et de David Delahaye. |
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.
Reviews

