|
In the mainstream categorical approach to typed (total) functional programming, functions with inductive source types defined by primitive recursion are called paramorphisms; the utility of primitive recursion as a scheme for defining functions in programming is well-known. We draw attention to the dual notion of apomorphisms--functions with coinductive target types defined by primitive corecursion-- and show on examples that primitive corecursion is useful in programming.
Apomorphisms were never mentioned on LtU before. This is simply not right...
Posted to functional by Ehud Lamm on 5/1/03; 3:30:48 AM
|
|
Functional Programming with Apomorphisms / Corecursion
