Tagging, encoding, and Jones optimality
| Autor Principal: | |
|---|---|
| Otros autores o Colaboradores: | |
| Formato: | Capítulo de libro |
| Lengua: | inglés |
| Series: | ^p Datos electrónicos (1 archivo : 438 KB)
|
| Temas: | |
| 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) |