In the field of program transformation, one often transforms programs into continuation-passing style to make their flow of control explicit, and then immediately removes the resulting continuations using defunctionalisation to make the programs first-order. In this article, we show how these two transformations can be fused together into a single transformation step that cuts out the need to first introduce and then eliminate continuations. Our approach is calculational, uses standard equational reasoning techniques, and is widely applicable.
CITATION STYLE
Hutton, G., & Bahr, P. (2016). Cutting out continuations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9600, pp. 187–200). Springer Verlag. https://doi.org/10.1007/978-3-319-30936-1_10
Mendeley helps you to discover research relevant for your work.