# 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)

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
• ACM SIGPLAN International Conference on…
• 2013
• Corpus ID: 1739255
In this paper, we study strong normalization of a core language based on System F-omega which supports programming with finite…
2012
2012
• 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
• Types for Proofs and Programs
• 2009
• Corpus ID: 1348287
We propose a (limited) solution to the problem of constructing stream values defined by recursive equations that do not respect…
2009
2009
• 2009
• Corpus ID: 145606812
textabstractCan computer scientists contribute to the solution of societal problems? Can logic help to model social interactions…
2008
2008
• International Workshop on Coalgebraic Methods in…
• 2008
• Corpus ID: 5665142
2007
2007
• Theory of Computing Systems
• 2007
• Corpus ID: 8618109
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
• Mathematical Structures in Computer Science
• 2004
• Corpus ID: 18892841
This paper introduces $\lambda^\widehat$, a simply typed lambda calculus supporting inductive types and recursive function…
2003
2003
• 2003
• Corpus ID: 13449098
We derive and factorize the fourth-order difference equations satisfied by orthogonal polynomials obtained from some…
1995
1995
• P. Maroni