Corecursion

Known as: Co-recursion, Co-recursive, Corecursive

In computer science, corecursion is a type of operation that is dual to recursion. Whereas recursion works analytically, starting on data further…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

Reasoning about finite data such as lists or even lambda terms is well understood and programming languages and proof systems o…

2010

We present our work in progress concerning the logical foundations of the analysis of termination for imperative recursive…

2010

It is possible to provide a proof for a coinductive type using a corecursive function coupled with a guardedness condition. The…

2008

This present work investigates theory and techniques of declarative and functional construction and processing of cyclical data…

2006

2006

Emerging interaction paradigms, such as service-oriented computing, and new technological challenges, such as exogenous component…

2004

We introduce concepts for representing interactive programs in dependent type theory. The representation uses a monad, as in…

2002

We show how to implement functionally the reverse, or adjoint strategy within the domain of Automatic Differentiation techniques…

1999

We construct a small arithmetic package operating on discrete sequences: u0, u1, u2, . . . treated as single mathematical…

1996

Let Qn(a;;/3,7,c) be the polynomials of degree n which satisfy the recurrence relation: a!n+cQn+i(a;/3,7,c) + a!n+c_iQn_i(z;/3,7…