Abstract

A partial evaluator is an automatic program transformation tool. Given as input a general program and part of its input, it can produce a specialized version. If the partial evaluator is self-applicable, program generators can be made. The goal is efficiency: the specialized program often runs an order of magnitude faster than the general one. We consider partial evaluation of the pragmatic oriented imperative C programming language. New problems studied includes partially static data structures, non-local static side-effects under dynamic control, and a restricted use of pointers. We define a Core C language, derive a two-level Core C language with explicit binding times, and formulate well-annotatedness conditions. Function specialization and code generation is described in terms of the two-level Core C language. An implementation of the C partial evaluator has been made. Some experimental results are given. 1

Citations

114	Automatic autoprojection of recursive equations with global variables and abstract data types, Science of Computer Programming 16 - Bondorf, Danvy - 1991
113	ILSoudergaard MIX: a self-applicable partial evaluator for experiments in compiler generation - Jones - 1989
90	A partial evaluator for the untyped lambda-calculus - Gomard, Jones - 1991
34	New insights into partial evaluation: The Schism experiment - Consel - 1988
23	Compiler Generation by Partial Evaluation: a Case Study - Gomard, Jones - 1991
23	Techniques for Partial Evaluation of Imperative Languages - Meyer - 1991
20	Partial evaluation of high-level imperative programming languages with applications in hard real-time systems - Nirkhe, Pugh - 1992
18	C program specialization - Andersen - 1992
16	A strongly-typed self-applicable partial evaluator - Launchbury - 1991
10	Partial Computation and the Construction of Language Processors - Pagan - 1991
6	The TML-approach to compiler-compilers - Nielson, Nielson - 1988
4	The C programming language (Draft-Proposed - Kernighan, Ritchie - 1988