Add topic "Corecursion" Accepted
Changes: 4
-
Add Classical (Co)Recursion: Programming
- Title
-
- Unchanged
- Classical (Co)Recursion: Programming
- Type
-
- Unchanged
- Paper
- Created
-
- Unchanged
- 2021-03-11
- Description
-
- Unchanged
- Our aim here is to illustrate how the benefits of structural corecursion can be found in a broader swath of the programming landscape than previously thought. Beginning from a tutorial on structural corecursion in the total, pure functional language Agda, we show how these same ideas are mapped to familiar concepts in a variety of different languages. We show how corecursion can be done in strict functional languages like Scheme, and even escapes the functional paradigm entirely, showing up in the natural expression of common object-oriented features found in languages like Python and Java.
- Link
-
- Unchanged
- http://arxiv.org/abs/2103.06913
- Identifier
-
- Unchanged
- no value
Resource | v1 | current (v1) -
Add Corecursion
- Title
-
- Unchanged
- Corecursion
- Description
-
- Unchanged
- 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.
- Link
-
- Unchanged
- https://en.wikipedia.org/?curid=1338683
Topic | v1 | current (v1) -
Add Corecursion treated in Classical (Co)Recursion: Programming
- Current
- treated in
Topic to resource relation | v1 -
Add Computer programming parent of Corecursion
- Current
- parent of
Topic to topic relation | v1