Equivalence of eval-readback and eval-apply big-step evaluators by structuring the lambda-calculus's strategy space (2212.02494v7)

Abstract: We study the equivalence between eval-readback and eval-apply big-step evaluators in the general setting of the pure lambda calculus. We study one-step' equivalence (same strategy) and also discussbig-step' equivalence (same final result). One-step equivalence extends for free to evaluators in other settings (calculi, programming languages, proof assistants, etc.) by restricting the terms (closed, convergent) while maintaining the strategy. We present a proof that one-step equivalence holds when (1) the readback' stage satisfies straightforward well-formedness provisos, (2) theeval' stage implements a uniform' strategy, and (3) the eval-apply evaluator implements abalanced hybrid' strategy that has eval' as a subsidiary strategy. The proof proceeds thelightweight fusion by fixed-point promotion' program transformation on evaluator implementations to fuse readback and eval into the balanced hybrid. The proof can be followed with no previous knowledge of the transformation. We use Haskell 2010 as the implementation language, with all evaluators written in monadic style to guarantee semantics (strategy) preservation, but the choice of implementation language is immaterial. To illustrate the large scope of the equivalence, we provide an extensive survey of the strategy space using canonical eval-apply evaluators in code and big-step `natural' operational semantics. We discuss the strategies' properties, some of their uses, and their abstract machines. We improve the formal definition of uniform and hybrid strategy, use it to structure the strategy space, and to obtain generic higher-order evaluators which are used in the equivalence proof. We introduce a systematic notation for both evaluator styles and use it to summarise strategy and evaluator equivalences, including (non-)equivalences within a style and (non-)equivalences between styles not proven by the transformation.