Partial Evaluation and Automatic Program Generation
by Neil D. Jones, Carsten K. Gomard, Peter Sestoft
Publisher: Prentice Hall 1993
ISBN/ASIN: 0130202495
ISBN-13: 9780130202499
Number of pages: 400
Description:
This book is about partial evaluation, a program optimization technique also known as program specialization. It presents general principles for constructing partial evaluators for a variety of programming languages, and it gives examples of applications and numerous references to the literature. Partial evaluation works with program texts rather than mathematical functions: a partial evaluator is an algorithm which, when given a program and some of its input data, produces a so-called residual or specialized program. Running the residual program on the remaining input data will yield the same result as running the original program on all of its input data.
Download or read it online for free here:
Download link
(1.7MB, PDF)
Similar books
Implementing Functional Languages: a tutorialby Simon Peyton Jones, David Lester - Prentice Hall
This book gives a practical approach to understanding implementations of non-strict functional languages using lazy graph reduction. It is intended to be a source of practical material, to help make functional-language implementations come alive.
(15296 views)
Type Systems for Programming Languagesby Robert Harper
Provides an account of the role of type theory in programming language design and implementation. The stress is on the use of types as a tool for analyzing programming language features and studying their implementation.
(18125 views)
Reasoned Programmingby Krysia Broda et al - Prentice Hall Trade
The text for advanced undergraduate/graduate students of computer science. It introduces functional, imperative and logic programming and explains how to do it correctly. Functional programming is presented as a programming language in its own right.
(14644 views)
Proofs and Typesby J. Girard, Y. Lafont, P. Taylor - Cambridge University Press
This little book comes from a short graduate course on typed lambda-calculus given at the Universite Paris. It is not intended to be encyclopedic and the selection of topics was really quite haphazard. Some very basic knowledge of logic is needed.
(20440 views)