Abstract

. A partial evaluator, given a program and a known "static" part of its input data, outputs a specialised or residual program in which computations depending only on the static data have been performed in advance. Ideally the partial evaluator would be a "black box" able to extract nontrivial static computations whenever possible; which never fails to terminate; and which always produces residual programs of reasonable size and maximal efficiency, so all possible static computations have been done. Practically speaking, partial evaluators often fall short of this goal; they sometimes loop, sometimes pessimise, and can explode code size. A partial evaluator is analogous to a spirited horse: while impressive results can be obtained when used well, the user must know what he/she is doing. Our thesis is that this knowledge can be communicated to new users of these tools. This paper presents a series of examples, concentrating on a quite broad and on the whole quite successful application ...

Citations

230	Partial evaluation in logic programming - Lloyd, Shepherdson - 1991
155	The concept of a supercompiler - Turchin - 1986
114	Automatic autoprojection of recursive equations with global variables and abstract data types, Science of Computer Programming 16 - Bondorf, Danvy - 1991
87	Automatic online partial evaluation - Weise, Conybeare, et al. - 1991
45	Partially static structures in a self-applicable partial evaluator - Mogensen - 1988
34	New insights into partial evaluation: The Schism experiment - Consel - 1988
30	Separating binding times in language specifications - Mogensen
28	Domains for Denotational Semantics - Nielsen, Schmidt, et al.
23	D.: BTA algorithms to ensure termination of off-line partial evaluation - Glenstrup, Jones
22	The Mixtus approach to automatic partial evaluation of full Prolog - Sahlin - 1990
20	Tutorial on specialization of logic programs - Gallagher - 1993
8	Self-applicable Partial Evaluation of Polymorphically Typed Functional Languages - Niel - 1993