An Introduction to Partial Evaluation

191Citations
Citations of this article
77Readers
Mendeley users who have this article in their library.

Abstract

Partial evaluation provides a unifying paradigm for a broad spectrum of work in program optimization, compiling, interpretation and the generation of automatic program generators [Bjørner et al. 1987; Ershov 1992; and Jones et al. 1993]. It is a program optimization technique, perhaps better called program specialization, closely related to but different from Jørring and Scherlis’ staging transformations [1986]. It emphasizes, in comparison with Burstall and Darlington [1977] and Jørring and Scherlis [1986] and other program transformation work, full automation and the generation of program generators as well as transforming single programs. Much partial evaluation work to date has concerned automatic compiler generation from an interpretive definition of a programming language, but it also has important applications to scientific computing, logic programming, metaprogramming, and expert systems; some pointers are given later. Categories and Subject Descriptors: D.2.M [Software Engineering]: Miscellaneous-rapid prototyping; D.3.4 [Programming Languages]: Processors. © 1996, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Jones, N. D. (1996). An Introduction to Partial Evaluation. ACM Computing Surveys, 28(3), 480–503. https://doi.org/10.1145/243439.243447

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free