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], as exemplified by the factorial function.
[edit] References
- ^ Phil 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.
- Erik Meijer, Maarten Fokkinga, and Ross Paterson. Functional Programming with Bananas, Lenses, Envelopes, and Barbed Wire [1]
