For example, integers with the sum function form an algebra over the list monad, because
1) for any list of ints, the sum is an int
2) the sum of [n] is just n
3) summing recursively is the same as summing over the flattened list.
More generally, the algebras over the List monad are exactly the monoids, with ‘merge [a, b]‘ as the monoid operation. Algebras over the Maybe monad are pointed sets, with ‘merge Nothing‘ as the distinguished point. A lot of algebraic structures (Lawvere theories) can be defined by a monad this way.
[0] Laws that ‘merge‘ should satisfy: merge (return x) == x fmap merge (merge mx) == merge (join mx)