Inductive and Coinductive Components of Corecursive Functions in Coq - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Inductive and Coinductive Components of Corecursive Functions in Coq

Yves Bertot


In Constructive Type Theory, recursive and corecursive definitions are subject to syntactic restrictions which guarantee termination for recursive functions and productivity for corecursive functions. However, many terminating and productive functions do not pass the syntactic tests. Bove proposed in her thesis an elegant reformulation of the method of accessibility predicates that widens the range of terminative recursive functions formalisable in Constructive Type Theory. In this paper, we pursue the same goal for productive corecursive functions. Notably, our method of formalisation of coinductive definitions of productive functions in Coq requires not only the use of ad-hoc predicates, but also a systematic algorithm that separates the inductive and coinductive parts of functions.
Fichier principal
Vignette du fichier
CMCS08BertotKomenda.pdf (261.29 Ko) Télécharger le fichier
dyn.v (4.71 Ko) Télécharger le fichier
exp_filter_s.v (11.36 Ko) Télécharger le fichier
exp_filter_t.v (22.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Other
Format : Other
Format : Other

Dates and versions

inria-00277075 , version 1 (05-05-2008)
inria-00277075 , version 2 (09-07-2008)


  • HAL Id : inria-00277075 , version 2
  • ARXIV : 0807.1524


Yves Bertot, Ekaterina Komendantskaya. Inductive and Coinductive Components of Corecursive Functions in Coq. Coalgebraic Methods in Computer Science, Apr 2008, Budapest, Hungary. ⟨inria-00277075v2⟩


427 View
526 Download



Gmail Facebook Twitter LinkedIn More