TY  - GEN
AU  - Danvy,Olivier
AU  - Martínez López,Pablo Ernesto
TI  - Tagging, encoding, and Jones optimality
T2  - ^p Datos electrónicos (1 archivo : 438 KB)
KW  - LENGUAJES DE PROGRAMACIÓN
KW  - SEMÁNTICA
KW  - EVALUACIÓN PARCIAL
N1  - Formato de archivo: PDF. -- Este documento es producción intelectual de la Facultad de Informática-UNLP (Colección BIPA / Biblioteca.) -- Disponible también en línea (Cons. 11 nov. 2008); Pierpaolo Degano. European Symposium on Programming (ESOP 2003), part of European Joint Conferences on Theory and Practice of Software (ETAPS), Springer Verlag, 335-347, Lecture Notes in Computer Science (LNCS), April 2003
N2  - A partial evaluator is said to be Jones-optimal if the result of specializing a self-interpreter with respect to a source program is textually identical to the source program, modulo renaming.  Jones optimality has already been obtained if the self-interpreter is untyped. If the  selfinterpreter is typed, however, residual programs are cluttered with type tags. To obtain the original source program, these tags must be removed. A number of sophisticated solutions have already been proposed. We observe, however, that with a simple representation shift, ordinary partial evaluation is already Jones-optimal, modulo an encoding. The representation shift amounts to reading the type tags as constructors for higherorder abstract syntax. We substantiate our observation by considering a typed self-interpreter whose input syntax is higher-order. Specializing this interpreter with respect to a source program yields a residual program that is textually identical to the source program, modulo renaming
UR  - www.lifia.info.unlp.edu.ar/papers/2003/Danvy2003.pdf
ER  -