Abstract
Abstract
In ‘Calculating Correct Compilers’ (Bahr & Hutton, 2015), we developed a new approach to calculating compilers directly from specifications of their correctness. Our approach only required elementary reasoning techniques and has been used to calculate compilers for a wide range of language features and their combination. However, the methodology was focused on stack-based target machines, whereas real compilers often target register-based machines. In this article, we show how our approach can naturally be adapted to calculate compilers for register machines.
Publisher
Cambridge University Press (CUP)
Reference29 articles.
1. Semantics-directed machine architecture
2. Trans. Program. Lang.;Wand;Syst,1982
3. Definitional interpreters for higher-order programming languages
4. PEPM. (2020) Workshop on Partial Evaluation and Program Manipulation. Available at: https://popl20.sigplan.org/home/pepm-2020.
5. From Interpreter to Compiler and Virtual Machine: A Functional Derivation
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Calculating Compilers for Concurrency;Proceedings of the ACM on Programming Languages;2023-08-30
2. Monadic compiler calculation (functional pearl);Proceedings of the ACM on Programming Languages;2022-08-29
3. Calculating dependently-typed compilers (functional pearl);Proceedings of the ACM on Programming Languages;2021-08-22