Strict and lazy composition (in the presence of evaluation order) do not associate. The phenomenon was observed multiple times in semantics (programming, proof theory).

Non-associativity is not only ubiquitous but also characterises by itself notions of computation with non-trivial evaluation order, as we will see.