Verified Inlining and Specialisation for PureCake
Uloženo v:
| Název: | Verified Inlining and Specialisation for PureCake |
|---|---|
| Autoři: | Kanabar, Hrutvik, Korban, Kacper, Myreen, Magnus, 1983 |
| Zdroj: | De nästa 700 verifierade kompilatorerna 33rd European Symposium on Programming, ESOP 2024, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 14577 LNCS:275-301 |
| Témata: | functional programming, machine-checked proofs, function inlining, loop optimisation, verified compilation |
| Popis: | Inlining is a crucial optimisation when compiling functional programming languages. This paper describes how we have implemented and verified function inlining and loop specialisation for PureCake, a verified compiler for a Haskell-like (purely functional, lazy) programming language. A novel aspect of our formalisation is that we justify inlining by pushing and pulling -bindings. All of our work has been mechanised in the HOL4 interactive theorem prover. |
| Popis souboru: | electronic |
| Přístupová URL adresa: | https://research.chalmers.se/publication/541093 https://research.chalmers.se/publication/541093/file/541093_Fulltext.pdf |
| Databáze: | SwePub |
Nájsť tento článok vo Web of Science | Abstrakt: | Inlining is a crucial optimisation when compiling functional programming languages. This paper describes how we have implemented and verified function inlining and loop specialisation for PureCake, a verified compiler for a Haskell-like (purely functional, lazy) programming language. A novel aspect of our formalisation is that we justify inlining by pushing and pulling -bindings. All of our work has been mechanised in the HOL4 interactive theorem prover. |
|---|---|
| ISSN: | 16113349 03029743 |
| DOI: | 10.1007/978-3-031-57267-8_11 |