Conservative Compiler Optimisations

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.