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
Categories, Types, and Structuresby Andrea Asperti, Giuseppe Longo - MIT Press
Here is an introduction to category theory for the working computer scientist. It is a self-contained introduction to general category theory and the mathematical structures that constitute the theoretical background.
(13044 views)
A Practical Theory of Programmingby Eric C.R. Hehner - Springer
Understanding programming languages requires knowledge of the underlying theoretical model. This book explores aspects of programming that are amenable to mathematical proof. It describes a simple and comprehensive theory.
(9502 views)
Formal Language Theory for Natural Language Processingby Shuly Wintner - ESSLLI
This text is a mild introduction to Formal Language Theory for students with little or no background in formal systems. The motivation is Natural Language Processing, and the presentation is geared towards NLP applications, with extensive examples.
(6200 views)
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.
(8110 views)