Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 209,890,473 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
44 relations
Anamorphism
Apomorphism
Assignment (computer science)
Bisimulation
Expand
Broader (3)
Category theory
Functional programming
Theoretical 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
Andreas Abel
,
B. Pientka
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…
Expand
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…
Expand
2009
2009
Using Structural Recursion for Corecursion
Yves Bertot
,
E. Komendantskaya
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…
Expand
2009
2009
Discourses on Social Software
V. Eijck
,
R. Verbrugge
2009
Corpus ID: 145606812
textabstractCan computer scientists contribute to the solution of societal problems? Can logic help to model social interactions…
Expand
2008
2008
Inductive and Coinductive Components of Corecursive Functions in Coq
Yves Bertot
,
E. Komendantskaya
International Workshop on Coalgebraic Methods in…
2008
Corpus ID: 5665142
2007
2007
Coinduction for Exact Real Number Computation
Ulrich Berger
,
Tie Hou
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…
Expand
Highly Cited
2004
Highly Cited
2004
Type-based termination of recursive definitions
G. Barthe
,
M. J. Frade
,
Eduardo Giménez
,
L. Pinto
,
T. Uustalu
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…
Expand
2003
2003
On Fourth-order Difference Equations for Orthogonal Polynomials of a Discrete Variable : Derivation , Factorization and Solutions
M. Foupouagnignia
,
W. KOEPFa
,
A. Ronveauxb
2003
Corpus ID: 13449098
We derive and factorize the fourth-order difference equations satisfied by orthogonal polynomials obtained from some…
Expand
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…
Expand
Highly Cited
1994
Highly Cited
1994
Codifying Guarded Definitions with Recursive Schemes
Eduardo Giménez
Types for Proofs and Programs
1994
Corpus ID: 36607964
We formalize an extension of the Calculus of Constructions with inductive and coinductive types which allows a more direct…
Expand
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)
ACCEPT & CONTINUE