Topic | v1 | created by jjones |

In computer science, corecursion is a type of operation that is dual to recursion. Whereas recursion works analytically, starting on data further from a base case and breaking it down into smaller data and repeating until one reaches a base case, corecursion works synthetically, starting from a base case and building it up, iteratively producing data further removed from a base case. Put simply, corecursive algorithms use the data that they themselves produce, bit by bit, as they become available, and needed, to produce further bits of data. A similar but distinct concept is generative recursion which may lack a definite "direction" inherent in corecursion and recursion.


subtopic of Computer programming

Computer programming is the process of designing and building an executable computer program to accom...

Edit details Edit relations Attach new author Attach new topic Attach new resource

treated in Classical (Co)Recursion: Programming

8.0 rating 2.0 level 8.0 clarity 2.0 background – 1 rating

Our aim here is to illustrate how the benefits of structural corecursion can be found in a broader sw...