Tagging, encoding, and jones optimality

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 ty...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Danvy, Olivier, Martínez López, Pablo E.
Formato: Objeto de conferencia
Lenguaje:Español
Publicado: 2003
Materias:
Informática
Jones optimality
self-interpreter
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/134244
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-134244
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Español
topic Informática
Jones optimality
self-interpreter
spellingShingle Informática
Jones optimality
self-interpreter
Danvy, Olivier
Martínez López, Pablo E.
Tagging, encoding, and jones optimality
topic_facet Informática
Jones optimality
self-interpreter
description 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.
format Objeto de conferencia
Objeto de conferencia
author Danvy, Olivier
Martínez López, Pablo E.
author_facet Danvy, Olivier
Martínez López, Pablo E.
author_sort Danvy, Olivier
title Tagging, encoding, and jones optimality
title_short Tagging, encoding, and jones optimality
title_full Tagging, encoding, and jones optimality
title_fullStr Tagging, encoding, and jones optimality
title_full_unstemmed Tagging, encoding, and jones optimality
title_sort tagging, encoding, and jones optimality
publishDate 2003
url http://sedici.unlp.edu.ar/handle/10915/134244
work_keys_str_mv AT danvyolivier taggingencodingandjonesoptimality
AT martinezlopezpabloe taggingencodingandjonesoptimality
bdutipo_str Repositorios
_version_ 1764820456658960386

Ejemplares similares