We complete the discussion of environments by adding recursion to the
previously considered language. We then present a computational model
based on transitions of an abstract machine. The machine works at a
high level, using continuations to keep track of remaining computations.
We also prove the correctness of the continuation machine compared to
the natural semantics presented earlier.