 Principles of programming languages

Solutions to all three questions of the paper dated 11 June 2015.^[ref] In the equations below, $r_m$ and ${▹}_m$ denote the base computational monad's result and sequencing operations. All equalities of computations are extensional: apply both sides to the same remaining arguments. Haskell fragments use result and bind for the paper's $\mathrm{result}$ and $▹$. The FunMem programs use the language's own syntax.