Skip to Main content Skip to Navigation
Conference papers

Defining and reasoning about recursive functions: a practical tool for the Coq proof assistant

Abstract : We present a practical tool for defining and proving properties of recursive functions in the Coq proof assistant. The tool proceeds by generating from pseudo-code (Coq functions that need not be total nor terminating) the graph of the intended function as an inductive relation, and then proves that the relation actually represents a function, which is by construction the function that we are trying to define. Then, we generate induction and inversion principles , and a fixpoint equation for proving other properties of the function. Our tool builds upon state-of-the-art techniques for defining recursive functions, and can also be used to generate executable functions from inductive descriptions of their graph. We illustrate the benefits of our tool on two case studies.
Document type :
Conference papers
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/inria-00564237
Contributor : Mister Dart Connect in order to contact the contributor
Submitted on : Tuesday, February 8, 2011 - 3:26:06 PM
Last modification on : Friday, February 4, 2022 - 3:22:59 AM
Long-term archiving on: : Monday, May 9, 2011 - 3:09:46 AM

File

2006-FLOPS.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00564237, version 1

Collections

Citation

Gilles Barthe, Julien Forest, David Pichardie, Vlad Rusu. Defining and reasoning about recursive functions: a practical tool for the Coq proof assistant. Functional and Logic Programming (FLOPS'06), 2006, Fuji Susono, Japan. ⟨inria-00564237⟩

Share

Metrics

Record views

113

Files downloads

194