Commutativity
Associativity
Appending as condensing a set of values to a summary value
Abelian or Commutative Monoid
Could be interesting for CRDT implementations
CRDTs are, in the basic case, a idempotent commutative monoid, aka an idempotent abelian monoid. https://news.ycombinator.com/item?id=7891598#:~:text=CRDTs%20are%2C%20in%20the%20basic%20case%2C%20a%20idempotent%20commutative%20monoid%2C%20aka%20an%20idempotent%20abelian%20monoid.

Appears in 2 boards

Folding & Foldable
Folding and Monoid
Folding in lists and its significance
`foldr` specifying the binary associative operation explicitly
`foldr` (right fold) and `foldl` (left fold) in lists
How to write folds
Catamorphisms as the generalization of folds
How `foldl` associates
How `foldr` associates
`foldl` implementation
`foldr` implementation
The “rest of the fold” in `foldr`
Folding as a two-stage process (traversal and folding)
Example of folding usage (Source: https://hackage.haskell.org/package/recursion-schemes-5.2.3#readme)