Abstract
In 'Calculating Correct Compilers' 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.
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.
Originalsprog | Engelsk |
---|---|
Artikelnummer | e25 |
Tidsskrift | Journal of Functional Programming |
Vol/bind | 30 |
ISSN | 0956-7968 |
DOI | |
Status | Udgivet - 20 aug. 2020 |
Emneord
- program calculation
- verified compiler
- register machines
- preorder
- Coq