Strictification of circular programs

• Tipo: Artigo em Livro de Atas de Conferência Internacional
• Data: 2011

Autores

Joao Paulo Fernandes (Autor) FEUP; Joao Saraiva (Autor) Outra; Daniel Seidel (Autor) Outra; Janis Voigtlander (Autor) Outra

Ata de Conferência Internacional

Título: Proceedings of the 2011 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2011, Austin, TX, USA, January 24-25, 2011

Páginas: 131-140

20th ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM'11

Austin, TX, 24 January 2011 through 24 January 2011

Indexação

Scopus - 8 Citações

Classificação Científica

FOS: Ciências exactas e naturais > Ciências da computação e da informação

Outras Informações

ID Authenticus: P-007-XHF

DOI: 10.1145/1929501.1929526

Abstract (EN): Circular functional programs (necessarily evaluated lazily) have been used as algorithmic tools, as attribute grammar implementations, and as target for program transformation techniques. Classically, Richard Bird [1984] showed how to transform certain multi-traversal programs (which could be evaluated strictly or lazily) into one-traversal ones using circular bindings. Can we go the other way, even for programs that are not in the image of his technique? That is the question we pursue in this paper. We develop an approach that on the one hand lets us deal with typical examples corresponding to attribute grammars, but on the other hand also helps to derive new algorithms for problems not previously in reach. © 2011 ACM.

Idioma: Inglês

Tipo (Avaliação Docente): Científica