Exploration of abstract machines and compilers in a typed interpreter framework, implying new optimization methods.
This paper explores a principled approach to calculating abstract machines and associated compilers, starting from an intrinsically typed interpreter. After deriving a compiler for a simple expression language in some detail, the first steps of this calculation are repeated to derive an optimizing evaluator for the simply typed lambda calculus.
No takes yet. Share an insight, caveat, or question.
Wouter Swierstra (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: