Anamorphism
 | This article may be too technical for most readers to understand. (May 2008) |
Template:Otheruses2 Anamorphism is a concept from functional programming grounded in category theory. The term comes from Greek ανα- (upwards) + morphism (from Greek μορφή, or form, shape).
Anamorphisms in functional programming
In functional programming, an anamorphism is a generalization of the list-producing unfolds known from functional programming to arbitrary abstract data types that can be described as final coalgebras. Unfolds are the co-recursive analogues of recursive folds.
One of the first publications to introduce the notion of an anamorphism in the context of programming was the paper Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire,[1] by Erik Meijer et al., which was in the context of the Squiggol programming language.
Anamorphisms in category theory
In category theory, anamorphisms are the categorical dual of catamorphisms.
Notation
A notation for ana f found in the literature is . The brackets used are known as lens brackets, after which anamorphisms are sometimes referred to as lenses.
![{\displaystyle [\!(f)\!]}](https://wikimedia.org/api/rest_v1/media/math/render/svg/99f892661108ecb4f29635a1f2416b724dff9f80)
See also
References
- ^ Meijer, Erik (1991). "Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire".
{{cite web}}: Unknown parameter|coauthors=ignored (|author=suggested) (help)
 | This formal methods-related article is a stub. You can help Wikipedia by expanding it. |