Apomorphism

From Wikipedia, the free encyclopedia

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 type.

[edit] Origins

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

[edit] References

  1. ^ Vene, Varma & Uustalu, Tarmo (1998), “Functional Programming with Apomorphisms (Corecursion)”, Proceedings of the Estonian Academy of Sciences: Physics, Mathematics 47 (3): 147–161, <http://citeseer.ist.psu.edu/vene98functional.html> 

[edit] See also

Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.