The Maximal MAM, a Reasonable Implementation of the Maximal Strategy

TL;DR

This paper introduces the Maximal MAM, an abstract machine designed to implement the maximal evaluation strategy in lambda-calculus, which always produces the longest possible evaluation sequence.

Contribution

It presents a new implementation of the maximal strategy through the Maximal MAM, providing a practical approach to simulate the longest evaluation sequences.

Findings

The Maximal MAM effectively implements the maximal strategy.

It guarantees the longest evaluation sequences in lambda-calculus.

The approach offers insights into evaluation strategies and their implementations.

Abstract

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.