Conservative Compiler Optimisations
| dc.contributor.author | Kyletoft, Samuel | |
| dc.contributor.author | Lundqvist Sternvik, Edvin | |
| dc.contributor.department | Chalmers tekniska högskola / Institutionen för data och informationsteknik | sv |
| dc.contributor.department | Chalmers University of Technology / Department of Computer Science and Engineering | en |
| dc.contributor.examiner | Gerdes, Alex | |
| dc.contributor.supervisor | Kovács, András | |
| dc.date.accessioned | 2026-01-19T08:16:39Z | |
| dc.date.issued | 2025 | |
| dc.date.submitted | ||
| dc.description.abstract | Modern functional programming is built upon heavy abstraction that compilers are not always able to optimise away. A two-stage compiler has been proposed to solve this, but lacking any optimisation this remains clunky to work in. We specify a number of optimisations in a way that they can be guaranteed to always be applied so that code generated by the first stage can be made simpler without causing any unnecessary overhead. | |
| dc.identifier.coursecode | DATX05 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.12380/310918 | |
| dc.language.iso | eng | |
| dc.setspec.uppsok | Technology | |
| dc.subject | compiler | |
| dc.subject | optimisation | |
| dc.subject | staged compilation | |
| dc.subject | functional programming | |
| dc.title | Conservative Compiler Optimisations | |
| dc.type.degree | Examensarbete för masterexamen | sv |
| dc.type.degree | Master's Thesis | en |
| dc.type.uppsok | H | |
| local.programme | Computer science – algorithms, languages and logic (MPALG), MSc |