Abstract
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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Gade, J., & Glück, R. (2006). On jones-optimal specializers: A case study using unmix. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4279 LNCS, pp. 406–422). Springer Verlag. https://doi.org/10.1007/11924661_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
