Tagging, encoding, and Jones optimality

Mostrar todas las versiones(2)
Detalles Bibliográficos
Autor Principal: Danvy, Olivier
Otros autores o Colaboradores: Martínez López, Pablo Ernesto
Formato: Capítulo de libro
Lengua:inglés
Series:^p Datos electrónicos (1 archivo : 438 KB)
Temas:
LENGUAJES DE PROGRAMACIÓN
SEMÁNTICA
EVALUACIÓN PARCIAL
Acceso en línea:www.lifia.info.unlp.edu.ar/papers/2003/Danvy2003.pdf
Consultar en el Cátalogo
Resumen: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.
Notas: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)

MARC

LEADER 00000naa a2200000 a 4500
003 AR-LpUFIB
005 20250311170243.0
008 230201s2003 xx o 000 0 eng d
024 8 |a DIF-M2507  |b 2596  |z DIF002408 
040 |a AR-LpUFIB  |b spa  |c AR-LpUFIB 
100 1 |a Danvy, Olivier 
245 1 0 |a Tagging, encoding, and Jones optimality 
490 0 |a ^p Datos electrónicos (1 archivo : 438 KB) 
500 |a 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) 
520 |a 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. 
534 |a 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. 
650 4 |a LENGUAJES DE PROGRAMACIÓN 
650 4 |a SEMÁNTICA 
650 4 |a EVALUACIÓN PARCIAL 
700 1 |a Martínez López, Pablo Ernesto 
856 4 0 |u www.lifia.info.unlp.edu.ar/papers/2003/Danvy2003.pdf 
942 |c CP 
952 |0 0  |1 0  |4 0  |6 A0067  |7 3  |8 BD  |9 76799  |a DIF  |b DIF  |d 2025-03-11  |l 0  |o A0067  |r 2025-03-11 17:02:43  |u http://catalogo.info.unlp.edu.ar/meran/getDocument.pl?id=70  |w 2025-03-11  |y CP 
999 |c 52299  |d 52299 

Ejemplares similares