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 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.Publicado en Basic Research in Computer Science, April, 2003.Laboratorio de Investigación y Formación en Informática Avanzad

An Analytical Approach to Programs as Data Objects

This essay accompanies a selection of 32 articles (referred to in bold face in the text and marginally marked in the bibliographic references) submitted to Aarhus University towards a Doctor Scientiarum degree in Computer Science.The author's previous academic degree, beyond a doctoral degree in June 1986, is an "Habilitation à diriger les recherches" from the Université Pierre et Marie Curie (Paris VI) in France; the corresponding material was submitted in September 1992 and the degree was obtained in January 1993.The present 32 articles have all been written since 1993 and while at DAIMI.Except for one other PhD student, all co-authors are or have been the author's students here in Aarhus

Cómo eliminar evidencia resolviendo restricciones para producir automáticamente programas tipados

This is an undergraduate thesis to obtain the degree of Licentiate in Computer Science in University of La Plata, Argentina. Since by standing rules of the institution this work must be presented in Spanish, the author would like to cross-refer the reader to a shorter English version of this work [Martinez Lopez and Badenes, 2003], that is being published in the Proceedings of the VII Argentinian Workshop on Theoretical Computer Science (WAIT 2003, Buenos Aires, September 2003). There, the core chapters of this work (Simplification, chapter 2, and Solving, chapter 3) are included (with a lower level of detail). In any case, we give an English introduction for better understanding the scope of this work.Tesis digitalizada en SEDICI gracias a la colaboración de la Biblioteca de la Facultad de Informática.Facultad de Informátic

Cómo eliminar evidencia resolviendo restricciones para producir automáticamente programas tipados

This is an undergraduate thesis to obtain the degree of Licentiate in Computer Science in University of La Plata, Argentina. Since by standing rules of the institution this work must be presented in Spanish, the author would like to cross-refer the reader to a shorter English version of this work [Martinez Lopez and Badenes, 2003], that is being published in the Proceedings of the VII Argentinian Workshop on Theoretical Computer Science (WAIT 2003, Buenos Aires, September 2003). There, the core chapters of this work (Simplification, chapter 2, and Solving, chapter 3) are included (with a lower level of detail). In any case, we give an English introduction for better understanding the scope of this work.Tesis digitalizada en SEDICI gracias a la colaboración de la Biblioteca de la Facultad de Informática.Facultad de Informátic

RS-2 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 self-interpreter 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 higher-order 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