Lazy Functional Languages: Abstract Interpretation and Compilation (Research Monographs in Parallel and Distributed Computing) ePub download
by Geoffrey Burn
- ISBN: 0262521601
- ISBN13: 978-0262521604
- ePub: 1202 kb | FB2: 1196 kb
- Language: English
- Category: Programming
- Publisher: The MIT Press (August 28, 1991)
- Pages: 238
- Rating: 4.1/5
- Votes: 798
- Format: lrf lit mbr rtf
7 Concurrent, parallel, and distributed computing. Description: From the abstract: "The global data relationships in a program can be exposed and codified by the static analysis methods described in this paper.
7 Concurrent, parallel, and distributed computing. A procedure is given which determines all the definitions which can possibly reach each node of the control flow graph of the program and all the definitions that are live on each edge of the graph.
Paperback: 238 pages. Publisher: The MIT Press (August 28, 1991). ISBN-13: 978-0262521604.
Lazy Functional Languges: Abstract Interpretation and Compilation. 5. P. Cousot and R. Cousot.
they are based on the principle of separation of logic and control. The lack of „control information in programs requires complex data-flow analyses. Lazy Functional Languges: Abstract Interpretation and Compilation.
Abstract Interpretation and Compilation.
Relationship to Other Work.
Some Example Abstract Interpretations. Relationship to Other Work.
By (author) Geoffrey Burn. Geoffrey Burn is Lecturer at Imperial College of Science, Technology, and Medicine, London. Learn about new offers and get more deals by joining our newsletter.
Pitman (in association with MIT Press). Science of Computer Programming, 7(November): 249–278. Cousineau, . Curien, . L. and Mauny, M. (1987) The categorical abstract machine. Science of Computer Programming, 8: 173–202. Cousot, P. and Cousot, R. (1979) Systematic Design of program analysis frameworks.
This book explores a subclass known as lazy functional languages, beginning with the theoretical issues and continuing through abstract interpretation and offering improved techniques for implementation.
The class of programming languages commonly known as functional includes Lisp, Scheme, ML, and Miranda TM. This book explores a subclass known as lazy functional languages, beginning with the theoretical issues and continuing through abstract interpretation and offering improved techniques for implementation. Now that advanced compiler technology has made it possible for lazy functional languages to compare favorably in run-time with more traditional languages such as C and Pascal, this monograph tackles problems of implementation such as time and memory overheads and restrictions on parallelism. Specifically, it describes a more efficient implementation model, the evaluation transformer model, that can be used when information is known about how functions use their arguments, develops a semantically sound analysis technique called abstract interpretation, which can determine this information, and shows how to use the information to compile more efficient code for sequential and parallel machines.
ContentsIntroduction • Operational and Denotational Semantics of the Typed Lambda Calculus • A Framework for the Abstract Interpretation of Functional Languages • Some Example Abstract Interpretations • Evaluation Transformers • Implementing Functional Languages on Sequential and Parallel Machines • Relationship to Other Work • Epilogue • Appendixes: Additional Proofs • The Spineless G-Machine