Abstract and conclusions of PLI invited paper: program generation, termination, and binding-time analysis

Abstract

Recent research suggests that the goal of fully automatic and reliable program generation for a broad range of applications is coming nearer to feasibility. However, several interesting and challenging problems remain to be solved before it becomes a reality. .We first discuss the relations between problem specifications and their solutions in program form, and then narrow the discussion to an important special case: program transformation. Although the goal of fully automatic program generation is still far from fully achieved, there has been some success in a special case: partial evaluation, also known as program specialization.A key problem in all program generation is <i>termination of the generation process</i>. This paper describes recent progress towards automatically solving the termination problem, first for individual programs, and then for specializers and "generating extensions," the program generators that most offline partial evaluators produce.

DOI: 10.1145/571157.571158

Extracted Key Phrases

Cite this paper

@inproceedings{Jones2002AbstractAC, title={Abstract and conclusions of PLI invited paper: program generation, termination, and binding-time analysis}, author={Neil D. Jones and Arne J. Glenstrup}, booktitle={PPDP}, year={2002} }