Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

44 relations
AnamorphismApomorphismAssignment (computer science)Bisimulation

Broader (3)

Category theoryFunctional programmingTheoretical computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Coinductive Predicates as Final Coalgebras
htmlabstractWe show that coinductive predicates expressing behavioural properties of infinite objects can be themselves expressed… 
2008
2008
On Algebras with Iteration
Several concepts of algebras with solutions of recursive equation systems are compared: CPO-enrichable algebras are proved to be… 
2007
2007
Strong Normalization and Equi-(Co)Inductive Types
A type system for the lambda-calculus enriched with recursive and corecursive functions over equi-inductive and -coinductive… 
2006
2006
Iteratively defined transfinite trace semantics and program slicing with respect to them
2004
2004
Guarded Induction and Weakly Final Coalgebras in Dependent Type Theory
We introduce concepts for representing interactive programs in dependent type theory. The representation uses a monad, as in… 
2003
2003
Certified reasoning on real numbers and objects in co-inductive type theory. (Raisonnement certifié sur les nombres réels et les objets en théorie des types co-inductifs)
Nous adoptons des Methodes Formelles basees sur la Theorie de Type pour raisonner sur la semantique des programmes: le but final… 
2002
2002
On the support of the measure of orthogonality of a class of orthogonal polynomials
1999
1999
Lazy Processing and Optimization of Discrete Sequences
We construct a small arithmetic package operating on discrete sequences: u0, u1, u2, . . . treated as single mathematical… 
1996
1996
Newton sum rules and monotonicity properties of the zeros of scaled co-recursive associated polynomials
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… 
1989
1989
Finite axiomatizability for equational theories of computable groupoids
A computable groupoid is an algebra ‹N, g› where N is the set of natural numbers and g is a recursive (total) binary operation on… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)