Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.entcs.2008.05.018 | Electronic Notes in Theoretical Computer Science |
Keywords | DocType | Volume |
productiveness,corecursive function,coinduction,corecursive definition,productive function,coq,induction,coinductive components,coinductive part,coinductive definition,terminative recursive functions formalisable,guardedness,accessibility predicates.,recursive function,productive corecursive function,constructive type theory,accessibility predicates,corecursive functions,syntactic test,production function,type theory | Journal | 203 |
Issue | ISSN | Citations |
5 | Electronic Notes in Theoretical Computer Science | 10 |
PageRank | References | Authors |
0.62 | 23 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yves Bertot | 1 | 442 | 40.82 |
| Ekaterina Komendantskaya | 2 | 150 | 22.66 |