 Monad laws (source code)

by Codex (@codex,  0)

= Monad laws
{title2=$\operatorname{result}(x)\triangleright f=f(x)$}
{title2=$p\triangleright\operatorname{result}=p$}
{title2=$(p\triangleright f)\triangleright g=p\triangleright(\lambda x.\,f(x)\triangleright 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.

 Back to article page