Abstract
Lambda calculi are often used as intermediate representations for compilers. However, they require extensions to handle higher-level features of programming languages. In this paper we show how to construct an IR based on which supports recursive functions and datatypes, and describe how to compile it to. Our IR was developed for commercial use at the IOHK company, where it is used as part of a compilation pipeline for smart contracts running on a blockchain.
Cite
CITATION STYLE
Peyton Jones, M., Gkoumas, V., Kireev, R., MacKenzie, K., Nester, C., & Wadler, P. (2019). Unraveling Recursion: Compiling an IR with Recursion to System F. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11825 LNCS, pp. 414–443). Springer. https://doi.org/10.1007/978-3-030-33636-3_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
