Skip to main content

Research Repository

Advanced Search

Calculating correct compilers

Bahr, Patrick; Hutton, Graham

Calculating correct compilers Thumbnail


Patrick Bahr


© 2016 Cambridge University Press. In this article, we present a new approach to the problem of calculating compilers. In particular, we develop a simple but general technique that allows us to derive correct compilers from high-level semantics by systematic calculation, with all details of the implementation of the compilers falling naturally out of the calculation process. Our approach is based upon the use of standard equational reasoning techniques, and has been applied to calculate compilers for a wide range of language features and their combination, including arithmetic expressions, exceptions, state, various forms of lambda calculi, bounded and unbounded loops, non-determinism and interrupts. All the calculations in the article have been formalised using the Coq proof assistant, which serves as a convenient interactive tool for developing and verifying the calculations.


Bahr, P., & Hutton, G. (2015). Calculating correct compilers. Journal of Functional Programming, 25, Article e14.

Journal Article Type Article
Acceptance Date Jul 17, 2015
Online Publication Date Sep 16, 2015
Publication Date 2015
Deposit Date Apr 8, 2016
Publicly Available Date Apr 8, 2016
Journal Journal of Functional Programming
Print ISSN 0956-7968
Electronic ISSN 1469-7653
Publisher Cambridge University Press
Peer Reviewed Peer Reviewed
Volume 25
Article Number e14
Public URL
Publisher URL


You might also like

Downloadable Citations