corecursion

Noun

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