Abstract
The logical representation, FOL, is useful for very high-level transformations, such as the determinacy-improving ones. It does not, however, expose any of the actual mechanisms used to implement specifications. In the final code, these mechanisms are too explicit, making optimizations more difficult. A continuation-passing style (CPS) representation sits in between these extremes, allowing operational behaviour to be expressed and manipulated in a declarative framework: the call-by-value λ-calculus.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Pettersson, M. (1999). 8 Compiling Continuations. In: Compiling Natural Semantics. Lecture Notes in Computer Science, vol 1549. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10693148_8
Download citation
DOI: https://doi.org/10.1007/10693148_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65968-6
Online ISBN: 978-3-540-48823-1
eBook Packages: Springer Book Archive