  This note is about a reasonable abstract machine, called Maximal MAM,
implementing the maximal strategy of the lambda-calculus, that is, the strategy
that always produces a longest evaluation sequence.
