On the generation of specializers
- 1 April 1994
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Functional Programming
- Vol. 4 (4) , 499-514
- https://doi.org/10.1017/s0956796800001167
Abstract
Self-applicable specializers have been used successfully to automate the generation of compilers. Specializers are often rather sophisticated, for which reason one would like to adapt and transform them with the aid of the computer. But how to automate this process? The answer to this question is given by three specializer projections. While the Futamura projections define the generation of compilers from interpreters, the specializer projections define the generation of specializers from interpreters. We discuss the potential applications of the specializer projections, and argue that their realization is a real touchstone for the effectiveness of the specialization principle. In particular, we discuss generic specializers, bootstrapping of subject languages and the generation of optimizing specializers from interpretive specifications. The Futamura projections are regarded as a special case of the specializer projections. Recent results confirm that the specializer projections can be performed in practice using partial evaluators.Keywords
This publication has 17 references indexed in Scilit:
- Improving binding times without explicit CPS-conversionPublished by Association for Computing Machinery (ACM) ,1992
- Automatic autoprojection of recursive equations with global variables and abstract data typesScience of Computer Programming, 1991
- Static and dynamic semantics processingPublished by Association for Computing Machinery (ACM) ,1991
- Towards multiple self-applicationPublished by Association for Computing Machinery (ACM) ,1991
- Inversion and metacomputationPublished by Association for Computing Machinery (ACM) ,1991
- Mix: A self-applicable partial evaluator for experiments in compiler generationHigher-Order and Symbolic Computation, 1989
- Partial evaluation of pattern matching in stringsInformation Processing Letters, 1989
- The concept of a supercompilerACM Transactions on Programming Languages and Systems, 1986
- Mixed computation: potential applications and problems for studyTheoretical Computer Science, 1982
- The use of metasystem transition in theorem proving and program optimizationLecture Notes in Computer Science, 1980