In formal methods of computer science, an apomorphism (from ἀπό — Greek for "apart") is the categorical dual of a paramorphism and an extension of the concept of anamorphism (coinduction).
Whereas a paramorphism models primitive recursion over an inductive data type, an apomorphism models primitive corecursion over a coinductive data type.
The term "apomorphism" was introduced in Functional Programming with Apomorphisms (Corecursion).
This formal methods-related article is a stub.
You can help Wikipedia by expanding it.