Paramorphism
From Wikipedia, the free encyclopedia
|
|
This article provides insufficient context for those unfamiliar with the subject. Please help improve the article with a good introductory style. (July 2010) |
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. Its categorical dual is the apomorphism
[edit] References
- ^ 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.
- ^ 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
| This formal methods-related article is a stub. You can help Wikipedia by expanding it. |