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.
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… Expand
  • figure 1
  • table 1
  • figure 2
  • table 3
  • figure 4
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
2012
2012
Type-Based Termination, Inflationary Fixed-Points, and Mixed Inductive-Coinductive Types
Type systems certify program properties in a compositional way. From a bigger program one can abstract out a part and certify the… Expand
  • figure 1
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
2008
2008
Inductive and Coinductive Components of Corecursive Functions in Coq
In Constructive Type Theory, recursive and corecursive definitions are subject to syntactic restrictions which guarantee… Expand
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… Expand
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
2002
2002
A Unifying Approach to Recursive and Co-recursive Definitions
In type theory based logical frameworks, recursive and corecursive definitions are subject to syntactic restrictions that ensure… Expand
Highly Cited
2001
Highly Cited
2001
Parametric corecursion
  • L. Moss
  • Theor. Comput. Sci.
  • 2001
    • Corpus ID: 9270464
This paper gives a treatment of substitution for \parametric" objects in nal coalgebras, and also presents principles of… Expand
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… Expand
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