Customer Reviews


2 Reviews
5 star:
 (1)
4 star:
 (1)
3 star:    (0)
2 star:    (0)
1 star:    (0)
 
 
 
 
 
Average Customer Review
Share your thoughts with other customers
Create your own review
 
 
Only search this product's reviews
Most Helpful First | Newest First

2 of 2 people found the following review helpful:
4.0 out of 5 stars Table of Contents, March 16, 2001
By 
"kimbly_b" (Boston, MA USA) - See all my reviews
This review is from: Lazy Functional Languages: Abstract Interpretation and Compilation (Research Monographs in Parallel and Distributed Computing) (Paperback)
Preface
List of figures
1 Introduction
1.1 Functional Programming Languages and Lazy Evaluation
1.2 The Evaluation Transformer Model of Reduction
1.3 An Introduction to Abstract Interpretation
1.4 Outline of Book
2 Operational and Denotational Semantics of the Typed Lambda Calculus
2.1 The Typed Lambda-Calculus
2.2 Sets with Structure
2.3 Interpretations
2.4 A Result Relating the Operational Semantics and Standard Interpretations of AT

2.5 Drawing it Together
3 A Framework for the Abstract Interpretation of Functional Languages
3.1 The Abstract Interpretation of AT
3.2 Abstraction and Concretisation Maps
3.3 Correctness of the Framework
3.4 Drawing it Together
4 Some Example Abstract Interpretations
4.1 An Abstract Interpretation for Evaluation Transformers
4.2 On Defining Abstract Domains
4.3 A Systematic Approach to Deriving Abstract Domains for Lists and Trees
4.4 Drawing it Together
5 Evaluation Transformers
5.1 Safe Changes to the Evaluation Strategy
5.2 Definition of Evaluators
5.3 Determining Evaluation Transformers
5.4 Drawing it Together
6 Implementing Functional Languages on Sequential and Parallel Machines
6.1 Graph Reduction
6.2 The Spineless G-machine
6.3 Relating the Graph Reduction Model to the Typed Lambda Calculus
6.4 Compiling Code for Evaluation Transformers
6.5 Drawing it Together
7 Relationship to Other Work
7.1 Abstract Interpretation
7.2 Polymorphism
7.3 Other Program Analysis Techniques
7.4 Implementation of Lazy Functional Languages
8 Epilogue
A Proofs Omitted in Earlier Chapters
B The Spineless G-Machine
B.1 Compilation Rules
B.2 Initial G-machine state
B.3 An Interpreter for the Spineless G-Machine
Bibliography
Index of Symbols
Index

Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


2 of 2 people found the following review helpful:
5.0 out of 5 stars I enjoyed it., April 19, 1999
By A Customer
This review is from: Lazy Functional Languages: Abstract Interpretation and Compilation (Research Monographs in Parallel and Distributed Computing) (Paperback)
Forced into the world of denotational semantics of functional languages, I found this book actually quite interesting and informative. Using lattice theory to look at the properties of functional evaluation provides for hours of entertaining reading.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


Most Helpful First | Newest First

This product