Towards type-directed compiler calculation
Abstract 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.
Authors
- Wouter Swierstra (ORCID: https://orcid.org/0000-0002-0295-7944)
Institutions
- Utrecht University (NL)
Publication Details
- Journal
- Journal of Functional Programming
- Published
- 2025-01-01
- DOI
- https://doi.org/10.1017/s0956796825100087
- Primary Topic
- Logic, programming, and type systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00