Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,182,832 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.
2018
2018
Coaxioms: flexible coinductive definitions by inference systems
Francesco Dagnino
Log. Methods Comput. Sci.
2018
Corpus ID: 51955443
We introduce a generalized notion of inference system to support more flexible interpretations of recursive definitions. Besides…
Expand
2015
2015
The Computational Contents of Ramified Corecurrence
D. Leivant
,
Ramyaa Ramyaa
Foundations of Software Science and Computation…
2015
Corpus ID: 35179
The vast power of iterated recurrence is tamed by data ramification: if a function over words is definable by ramified recurrence…
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
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
Coinduction for Exact Real Number Computation
Ulrich Berger
,
Tie Hou
Theory of Computing Systems
2008
Corpus ID: 8618109
Abstract This paper studies coinductive representations of real numbers by signed digit streams and fast Cauchy sequences. It is…
Expand
2005
2005
Context-Free Languages via Coalgebraic Trace Semantics
I. Hasuo
,
B. Jacobs
Conference on Algebra and Coalgebra in Computer…
2005
Corpus ID: 215533168
We show that, for functors with suitable mild restrictions, the initial algebra in the category of sets and functions gives rise…
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
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)
Alberto Ciaffaglione
2003
Corpus ID: 18756037
Nous adoptons des Methodes Formelles basees sur la Theorie de Type pour raisonner sur la semantique des programmes: le but final…
Expand
Highly Cited
1998
Highly Cited
1998
Calculus in coinductive form
Dusko Pavlovic
,
M. Escardó
Proceedings. Thirteenth Annual IEEE Symposium on…
1998
Corpus ID: 5668940
Coinduction is often seen as a way of implementing infinite objects. Since real numbers are typical infinite objects, it may not…
Expand
1997
1997
Ensuring the Productivity of Infinite Structures
Alastair J. Telford
,
David TurnerSeptember
1997
Corpus ID: 60861236
It is our aim to produce an elementary strong functional programming (ESFP) system. To be useful, ESFP should include structures…
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