Classical (Co)Recursion: Programming
Type Paper
Created 2021-03-11
Available at arxiv.org/abs/2103.06913
Identifier unavailable
Description
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.
Relations
In computer science, corecursion is a type of operation that is dual to recursion. Whereas recursion...
Edit details Edit relations Attach new author Attach new topic Attach new resource
8.0 /10
useless alright awesome
from 1 review
- Resource level 2.0 /10
- beginner intermediate advanced
- Resource clarity 8.0 /10
- hardly clear sometimes unclear perfectly clear
- Reviewer's background 2.0 /10
- none basics intermediate advanced expert
Comments 1
8 rating 2 level 8 clarity 2 user's background
Introduces co-recursion well
Does not give examples of co-recursion apart from streams