Paramorphism

From Wikipedia, the free encyclopedia

A paramorphism (from Greek παρα, meaning "close together") is an extension of the concept of catamorphism to deal with a form which “eats its argument and keeps it too”^[1][2], as exemplified by the factorial function.

[edit] References

1. ^ Philip Wadler. Views: A way for pattern matching to cohabit with data abstraction. Technical Report 34, Programming Methodology Group, University of Göteburg and Chalmers University of Technology, March 1987.
2. ^ Meijer, Erik; Fokkinga, Maarten; Paterson, Ross (1991). "Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire". http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.41.125&rep=rep1&type=pdf. 

[edit] See also

• Anamorphism
• Apomorphism
• Catamorphism
• Hylomorphism