Compiling with ContinuationsPaperback
List price $93.71
You save $6.69 (7%)
Free delivery worldwide
Dispatched in 3 business days
When will my order arrive?
- Publisher: CAMBRIDGE UNIVERSITY PRESS
- Format: Paperback | 272 pages
- Dimensions: 173mm x 241mm x 18mm | 386g
- Publication date: 12 February 2007
- Publication City/Country: Cambridge
- ISBN 10: 052103311X
- ISBN 13: 9780521033114
- Edition statement: Revised ed.
- Illustrations note: 19 tables
- Sales rank: 634,490
The control and data flow of a program can be represented using continuations, a concept from denotational semantics that has practical application in real compilers. This book shows how continuation-passing style is used as an intermediate representation on which to perform optimisations and program transformations. Continuations can be used to compile most programming languages. The method is illustrated in a compiler for the programming language Standard ML. However, prior knowledge of ML is not necessary, as the author carefully explains each concept as it arises. This is the first book to show how concepts from the theory of programming languages can be applied to the producton of practical optimising compilers for modern languages like ML. This book will be essential reading for compiler writers in both industry and academe, as well as for students and researchers in programming language theory.
Other people who viewed this bought:
$67.25 - Save $10.84 13% off - RRP $78.09
$69.44 - Save $8.65 11% off - RRP $78.09
$19.29 - Save $4.13 17% off - RRP $23.42
$69.20 - Save $16.70 19% off - RRP $85.90
Other books in this category
$34.38 - Save $7.78 18% off - RRP $42.16
$24.01 - Save $11.14 31% off - RRP $35.15
$34.07 - Save $3.40 (9%) - RRP $37.47
$37.63 - Save $12.34 24% off - RRP $49.97
"I recommend the book to language designers and implementors specializing in the functional paradigm." F.G. Pagan, Computing Reviews
Table of contents
Acknowledgements; 1. Overview; 2. Continuation-passing style; 3. Semantics of the CPS; 4. ML-specific optimizations; 5. Conversion into CPS; 6. Optimization of the CPS; 7. Beta expansion; 8. Hoisting; 9. Common subexpressions; 10. Closure conversion; 11. Register spilling; 12. Space complexity; 13. The abstract machine; 14. Machine-code generation; 15. Performance evaluation; 16. The runtime system; 17. Parallel programming; 18. Future directions; Appendices; Bibliography; Index.