Partial evaluation and &ohgr;-completeness of algebraic specifications
Theoretical Computer Science
Partial evaluation of pattern matching in strings
Information Processing Letters
Separating binding times in language specifications
FPCA '89 Proceedings of the fourth international 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
Towards creating specialised integrity checks through partial evaluation of meta-interpreters
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
The essence of eta-expansion in partial evaluation
Lisp and Symbolic Computation - Special issue on partial evaluation and semantics-based program manipulation (PEPM '94)
Realistic compilation by partial evaluation
PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
A regeneration scheme for generating extensions
Information Processing Letters
Bootstrapping higher-order program transformers from interpreters
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Jones optimality, binding-time improvements, and the strength of program specializers
ASIA-PEPM '02 Proceedings of the ASIAN symposium on Partial evaluation and semantics-based program manipulation
Partial Evaluation of Computation Process—AnApproach to a Compiler-Compiler
Higher-Order and Symbolic Computation
For a Better Support of Static Data Flow
Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
Partial Evaluation, Self-Application and Types
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Efficient Multi-level Generating Extensions for Program Specialization
PLILPS '95 Proceedings of the 7th International Symposium on Programming Languages: Implementations, Logics and Programs
Polyvariant Expansion and Compiler Generators
Proceedings of the Second International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Occam's Razor in Metacompuation: the Notion of a Perfect Process Tree
WSA '93 Proceedings of the Third International Workshop on Static Analysis
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
The structure of a self-applicable partial evaluator
Programs as Data Objects, Proceedings of a Workshop
The abstraction and instantiation of string-matching programs
The essence of computation
WSDFU: program transformation system based on generalized partial computation
The essence of computation
Offline partial evaluation can be as accurate as online partial evaluation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Transformation by interpreter specialisation
Science of Computer Programming - Special issue on program transformation
Jones optimality and hardware virtualization: a report on work in progress
PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Efficient and flexible access control via Jones-optimal logic program specialisation
Higher-Order and Symbolic Computation
Imperative-program transformation by instrumented-interpreter specialization
Higher-Order and Symbolic Computation
Tagging, encoding, and jones optimality
ESOP'03 Proceedings of the 12th European conference on Programming
On jones-optimal specializers: a case study using unmix
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Self-generating program specializers
Information Processing Letters
An experiment with the fourth futamura projection
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
| Hi-index | 0.00 |
Jones optimality implies that a program specializer is strong enough to remove an entire level of self-interpretation. This paper argues that Jones optimality, which was originally devised as a criterion for self-applicable specializers, plays a fundamental role in the use of a binding-time improvement prepass prior to specialization. We establish that, regardless of the binding-time improvements applied to a subject program (no matter how extensively), a specializer that is not Jones-optimal is strictly weaker than a specializer that is Jones-optimal. We describe the main approaches that increase the strength of a specializer without requiring its modification, namely incremental specialization and the interpretive approach, and show that they are equally powerful when the specializer is bti-universal. Since this includes the generation of program specializers from interpreters, the theoretical possibility of bootstrapping powerful specializers is established.