Information and Computation - Semantics of Data Types
On the productivity of recursive list definitions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Handbook of logic in computer science (vol. 2)
Infinite objects in type theory
TYPES '93 Proceedings of the international workshop on Types for proofs and programs
Inductive Definitions in the system Coq - Rules and Properties
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
The Relevance of Proof-Irrelevance
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Exercises in Coalgebraic Specification
Revised Lectures from the International Summer School and Workshop on Algebraic and Coalgebraic Methods in the Mathematics of Program Construction
Algebraic and coalgebraic methods in the mathematics of program construction
Simple general recursion in type theory
Nordic Journal of Computing
Proof-assistants using dependent type systems
Handbook of automated reasoning
Type-based termination of recursive definitions
Mathematical Structures in Computer Science
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
Modelling general recursion in type theory
Mathematical Structures in Computer Science
Affine functions and series with co-inductive real numbers
Mathematical Structures in Computer Science
General recursion in type theory
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
A unifying approach to recursive and co-recursive definitions
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Filters on coinductive streams, an application to eratosthenes' sieve
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Productivity of stream definitions
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Using Structural Recursion for Corecursion
Types for Proofs and Programs
Coalgebraic Reasoning in Coq: Bisimulation and the λ-Coiteration Scheme
Types for Proofs and Programs
Feasible functions over co-inductive data
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Formal polytypic programs and proofs
Journal of Functional Programming
The optimal fixed point combinator
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Coinductive Predicates and Final Sequences in a Fibration
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
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.