Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
Partial Evaluation and Mixed Computation: Proceedings of the IFIP TC2 Workshop, Gammel Avernaes, Denmark, 18-24 Oct., 1987
Arity Raiser and its Use in Program Specialization
ESOP '90 Proceedings of the 3rd European Symposium on Programming
Tag Elimination and Jones-Optimality
PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
On Jones-Optimal Specialization for Strongly Typed Languages
SAIG '00 Proceedings of the International Workshop on Semantics, Applications, and Implementation of Program Generation
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
Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
Tagging, encoding, and jones optimality
ESOP'03 Proceedings of the 12th European conference on Programming
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
An investigation of Jones optimality and BTI-universal specializers
Higher-Order and Symbolic Computation
An experiment with the fourth futamura projection
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
A self-applicable online partial evaluator for recursive flowchart languages
Software—Practice & Experience
| Hi-index | 0.00 |
Jones optimality is a criterion for assessing the strength of a program specializer. Here, the elements required in a proof of Jones optimality are investigated and the first formal proof for a non-trivial polyvariant specializer (Unmix) is presented. A simplifying element is the use of self-application. Variations of the original criterion are discussed.