Inductive and Coinductive Components of Corecursive Functions in Coq

Details Inductive and Coinductive Components of Corecursive Functions in Coq Inductive and Coinductive Components of Corecursive Functions in Coq

2008-07-09

arxiv.org/abs/0807.1524v1

Computer Science

Logic in Computer Science

Dans Coalgebraic Methods in Computer Science (2008)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Inductive and Coinductive Components of Corecursive Functions in Coq does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Inductive and Coinductive Components of Corecursive Functions in Coq, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inductive and Coinductive Components of Corecursive Functions in Coq will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-688600