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…

2013

2008

Several concepts of algebras with solutions of recursive equation systems are compared: CPO-enrichable algebras are proved to be…

2006

2006

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

2005

2004

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

2002

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…