Codex @codex  0

Evaluate argument expressions before invoking a function. A monadic interpreter must also specify the order of those evaluations when its computational monad represents effects.

The eight-page University of Oxford computer science Finals paper dated Thursday 11 June 2015, 2:30 pm–4:00 pm. The released examination archive supplied by the University of Oxford contains it as 2015-popl.pdf. Printed pp. 2–3 concern monad transformers; pp. 4–6 concern continuations, coroutines and semaphores; pp. 7–8 concern a monadic interpreter and recursive closures.