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.
Highly Cited
2013
Highly Cited
2013
Wellfounded recursion with copatterns: a unified approach to termination and productivity
In this paper, we study strong normalization of a core language based on System F-omega which supports programming with finite… 
2012
2012
Regular corecursion in Prolog
  • D. Ancona
  • ACM Symposium on Applied Computing
  • 2012
  • Corpus ID: 17713316
Co-recursion is the ability of defining a function that produces some infinite data in terms of the function and the data itself… 
2009
2009
Using Structural Recursion for Corecursion
We propose a (limited) solution to the problem of constructing stream values defined by recursive equations that do not respect… 
2009
2009
Discourses on Social Software
textabstractCan computer scientists contribute to the solution of societal problems? Can logic help to model social interactions… 
2008
2008
Inductive and Coinductive Components of Corecursive Functions in Coq
2007
2007
Coinduction for Exact Real Number Computation
Abstract This paper studies coinductive representations of real numbers by signed digit streams and fast Cauchy sequences. It is… 
Highly Cited
2004
Highly Cited
2004
Type-based termination of recursive definitions
This paper introduces $\lambda^\widehat$, a simply typed lambda calculus supporting inductive types and recursive function… 
2003
2003
On Fourth-order Difference Equations for Orthogonal Polynomials of a Discrete Variable : Derivation , Factorization and Solutions
We derive and factorize the fourth-order difference equations satisfied by orthogonal polynomials obtained from some… 
1995
1995
An introduction to second degree forms
  • P. Maroni
  • Advances in Computational Mathematics
  • 1995
  • Corpus ID: 43855053
We are dealing with orthogonal sequences with respect to forms verifying a second degreee equation, i.e. that its formal… 
Highly Cited
1994
Highly Cited
1994
Codifying Guarded Definitions with Recursive Schemes
We formalize an extension of the Calculus of Constructions with inductive and coinductive types which allows a more direct… 
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)