Catamorphisms - HaskellWiki

Folding data structures An overview and derivation of the category-theoretic notion of a catamorphism as a recursion scheme, and an exploration of common variations on the theme. Description Catamorphisms are generalizations of the concept of a fold in functional programming. A catamorphism deconstructs a data structure with an F-algebra for its underlying functor. History The name catamorphism ap

[ilyaletre]

TaPL 3章読んでて、項の簡約ってcatamorphismっぽい？ と思ったのでブクマしておく。項を状態とみなした場合の遷移関数が Algebra :: f a → a だとするとちょっと形が違う気もするけど。

[t10471]

F-W-algebrasってなに？[haskell]