Defining and reasoning about recursive functions: a practical tool for the Coq proof assistant - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

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.
Fichier principal
Vignette du fichier
2006-FLOPS.pdf (381 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00564237 , version 1 (08-02-2011)

Identifiers

  • HAL Id : inria-00564237 , version 1

Cite

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⟩
120 View
213 Download

Share

Gmail Facebook X LinkedIn More