Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Related topics

Related topics

44 relations
AnamorphismApomorphismAssignment (computer science)Bisimulation
Expand

Broader (3)

Category theoryFunctional programmingTheoretical computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Friends with Benefits - Implementing Corecursion in Foundational Proof Assistants
We introduce AmiCo, a tool that extends a proof assistant, Isabelle/HOL, with flexible function definitions well beyond primitive… Expand
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
2012
2012
Regular corecursion in Prolog
Co-recursion is the ability of defining a function that produces some infinite data in terms of the function and the data itself… Expand
  • figure 1
  • figure 2
Is this relevant?
2009
2009
Discourses on Social Software
textabstractCan computer scientists contribute to the solution of societal problems? Can logic help to model social interactions… Expand
  • figure 1
  • figure 1
Is this relevant?
2008
2008
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… Expand
  • table 1
Is this relevant?
2005
2005
Context-Free Languages via Coalgebraic Trace Semantics
We show that, for functors with suitable mild restrictions, the initial algebra in the category of sets and functions gives rise… Expand
Is this relevant?
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… Expand
  • figure 1.2
  • figure 1.3
Is this relevant?
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… Expand
Is this relevant?
1999
1999
A Predicative Strong Normalisation Proof for a λ-Calculus with Interleaving Inductive Types ” Errata and New Ideas
t whd t ′ E[t′] ∈ SN E[t] ∈ SN is wrong. Counterexample: Let Ω be a diverging term, t ≡ (λx.y) Ω and t′ = y. The correct… Expand
Is this relevant?
1998
1998
Functional differentiation of computer programs
We present two purely functional implementations of the computational differentiation tools -- the well known numeric (not… Expand
Is this relevant?
1995
1995
An introduction to second degree forms
We are dealing with orthogonal sequences with respect to forms verifying a second degreee equation, i.e. that its formal… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE