Partial evaluation and &ohgr;-completeness of algebraic specifications
Theoretical Computer Science
The structure of a self-applicable partial evaluator
on Programs as data objects
Partial evaluation of pattern matching in strings
Information Processing Letters
Partial evaluation, self-application and types
Proceedings of the seventeenth international colloquium on Automata, languages and programming
For a better support of static data flow
Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Generating a compiler for a lazy language by partial evaluation
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
Extracting polyvariant binding time analysis from polyvariant specializer
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Realistic compilation by partial evaluation
PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Bootstrapping higher-order program transformers from interpreters
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Program Generation, Termination, and Binding-Time Analysis
GPCE '02 Proceedings of the 1st ACM SIGPLAN/SIGSOFT conference on Generative Programming and Component Engineering
Polyvariant Expansion and Compiler Generators
Proceedings of the Second International Andrei Ershov Memorial Conference on Perspectives of System Informatics
On the Mechanics of Metasystem Hierarchies in Program Transformation
LOPSTR '95 Proceedings of the 5th International Workshop on Logic Programming Synthesis and Transformation
Evolution of Partial Evaluators: Removing Inherited Limits
Selected Papers from the Internaltional Seminar on Partial Evaluation
MK Pattern Match Compilation and Partial Evaluation
Selected Papers from the Internaltional Seminar on Partial Evaluation
Offline partial evaluation can be as accurate as online partial evaluation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Higher-Order and Symbolic Computation
An investigation of Jones optimality and BTI-universal specializers
Higher-Order and Symbolic Computation
Report on an implementation of a semi-inverter
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Finally tagless, partially evaluated: tagless staged interpreters for simpler typed languages
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Semi-inversion of guarded equations
GPCE'05 Proceedings of the 4th international conference on Generative Programming and Component Engineering
| Hi-index | 0.00 |
Jones optimality tells us that a program specializer is strong enough to remove an entire level of self-interpretation. We show that Jones optimality, which was originally aimed at the Futamura projections, plays an important role in binding-time improvements. The main results show that, regardless of the binding-time improvements which we apply to a source program, no matter how extensively, a specializer that is not Jones-optimal is strictly weaker than a specializer which is Jones optimal. By viewing a binding-time improver as a generating extension of a self-interpreter, we can connect our results with previous work on the interpretive approach.