- corecursion
-
The dual to recursion, that acts on the computed result, rather than the input.
The natural numbers may be defined by corecursion as .
See Also: co-recursive
Wikipedia foundation.
corecursion
Look at other dictionaries:
Corecursion — In computer science, corecursion is a type of operation that is dual to recursion. Corecursion and codata allow total languages to work with infinite data structures such as streams. Corecursion is often used in conjunction with lazy evaluation.… … Wikipedia
Apomorphism — An apomorphism (from απο Greek for apart ) is the categorical dual of a paramorphism. Whereas a paramorphism models primitive recursion over an inductive data type, an apomorphism models primitive corecursion over a coinductive data… … Wikipedia
Recursion — Recursion, in mathematics and computer science, is a method of defining functions in which the function being defined is applied within its own definition. The term is also used more generally to describe a process of repeating objects in a self… … Wikipedia
Generator (computer science) — In computer science, a generator is a special routine that can be used to control the iteration behaviour of a loop. A generator is very similar to a function that returns an array, in that a generator has parameters, can be called, and generates … Wikipedia
Coinduction — codata redirects here. For the CODATA committee, see Committee on Data for Science and Technology. In computer science, coinduction is a technique for defining and proving properties of systems of concurrent interacting objects. Coinduction is… … Wikipedia
Total functional programming — (also known as strong functional programming [This term is due to: Citation|last1=Turner|first1=D.A.|author link=David Turner (computer scientist)|contribution=Elementary Strong Functional Programming|title=First International Symposium on… … Wikipedia
Anamorphisme — Traduction à relire Anamorphism → Anamorphisme … Wikipédia en Français
co-recursive — adjective Describing a definition, particularly of an algorithm, given in terms of its output, rather than its input. Co recursive algorithms allow infinite large objects to be used without necessarily running out of memory. See Also: corecursion … Wiktionary
Curry–Howard correspondence — A proof written as a functional program: the proof of commutativity of addition on natural numbers in the proof assistant Coq. nat ind stands for mathematical induction, eq ind for substitution of equals and f equal for taking the same function… … Wikipedia
