Apomorphism

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by StephenWeber (talk | contribs) at 21:36, 4 August 2014 (Removing excessive (and dead) link to "coinductive data type" as Coinduction has already been linked earlier in the article.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

Origins

The term "apomorphism" was introduced in Functional Programming with Apomorphisms (Corecursion).[1]

See also

References

  1. ^ Vene, Varmo; Uustalu, Tarmo (1998), "Functional Programming with Apomorphisms (Corecursion)", Proceedings of the Estonian Academy of Sciences: Physics, Mathematics, 47 (3): 147–161