Apomorphism
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.
Origins
The term "apomorphism" was introduced in Functional Programming with Apomorphisms (Corecursion).[1]
gollark: Write your code in Scratch!
gollark: I'd actually argue that despite somehow sounding similar code editing and document editing are basically entirely different. Yes, they both load/display files, and have fonts and stuff, but there's almost no overlap.
gollark: My command line is far easier to use than a visual, because it has loads of options and I don't want a GUI with a billion buttons.
gollark: Not at all!
gollark: You'd end up with people still effectively programming only with an unintuitive visual interface.
See also
- Morphism
- Morphisms of F-algebras
- From an initial algebra to an algebra: Catamorphism
- From a coalgebra to a final coalgebra: Anamorphism
- An anamorphism followed by an catamorphism: Hylomorphism
- Extension of the idea of catamorphisms: Paramorphism
References
- Vene, Varmo; Uustalu, Tarmo (1998), "Functional Programming with Apomorphisms (Corecursion)", Proceedings of the Estonian Academy of Sciences: Physics, Mathematics, 47 (3): 147–161
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.