Andere Kunden interessierten sich auch für
![Semantics and Algebraic Specification]( "Semantics and Algebraic Specification")
Semantics and Algebraic Specification37,99 €![Compiling Parallel Loops for High Performance Computers]( "Compiling Parallel Loops for High Performance Computers")
Compiling Parallel Loops for High Performance Computers79,99 €![Compiling Parallel Loops for High Performance Computers]( "Compiling Parallel Loops for High Performance Computers")
Compiling Parallel Loops for High Performance Computers77,99 €![Compiling Natural Semantics]( "Compiling Natural Semantics")
Compiling Natural Semantics39,99 €![Building Parallel, Embedded, and Real-Time Applications with Ada]( "Building Parallel, Embedded, and Real-Time Applications with Ada")
Building Parallel, Embedded, and Real-Time Applications with Ada111,99 €![Building High Integrity Applications with SPARK]( "Building High Integrity Applications with SPARK")
Building High Integrity Applications with SPARK60,99 €![Algorithm Design with Haskell]( "Algorithm Design with Haskell")
Algorithm Design with Haskell72,99 €
This book shows how the theory of programming languages can be applied to the production of practical optimizing compilers for modern languages (such as ML).
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 optimizations 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 book shows how concepts from the theory of programming languages can be applied to the producton of practical optimizing 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.
Review quote:
'I recommend the book (?)0;' Computing Reviews
Table of contents:
Acknowledgments; 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; Appendix A. Introduction to ML; Appendix B. Semantics of the CPS; Appendix C. Obtaining standard ML of New Jersey; Appendix D. Readings; Bibliography; Index.
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 optimizations 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 book shows how concepts from the theory of programming languages can be applied to the producton of practical optimizing 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.
Review quote:
'I recommend the book (?)0;' Computing Reviews
Table of contents:
Acknowledgments; 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; Appendix A. Introduction to ML; Appendix B. Semantics of the CPS; Appendix C. Obtaining standard ML of New Jersey; Appendix D. Readings; Bibliography; Index.