Monad laws ($\mathrm{result}(x)▹f=f(x)$, $p▹\mathrm{result}=p$, $(p▹f)▹g=p▹(\lambda x.f(x)▹g)$)

The left and right identity laws and the associativity law for a computational monad. They justify regrouping sequencing while preserving the order and multiplicity of effects.