1.NounThe dual to recursion, that acts on the computed result, rather than the input.
"The natural numbers
N
{\displaystyle \mathbb {N} }
may be defined by corecursion as
{
0
}
∪
{
n
+
1
|
n
∈
N
}
{\displaystyle \{0\}\cup \{n+1|n\in \mathbb {N} \}}
.; Programming languages with lazy evaluation support corecursion so that the programmer can refer to infinite objects."