Paramorphism
 | This article provides insufficient context for those unfamiliar with the subject. (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
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 (1991). "Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire".
{{cite web}}: Unknown parameter|coauthors=ignored (|author=suggested) (help)
See also
 | This formal methods-related article is a stub. You can help Wikipedia by expanding it. |