Shortcut fusion rules for the derivation of circular and higher-order programs

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

Autores

Pardo, A (Autor) Outra; Joao Paulo Fernandes (Autor) FEUP; Saraiva, J (Autor) Outra

Ata de Conferência Internacional

Título: Higher-Order and Symbolic Computation

Páginas: 115-149

Indexação

Scopus - 7 Citações

Outras Informações

ID Authenticus: P-008-43B

DOI: 10.1007/s10990-011-9076-x

Abstract (EN): Functional programs often combine separate parts using intermediate data structures for communicating results. Programs so defined are modular, easier to understand and maintain, but suffer from inefficiencies due to the generation of those gluing data structures. To eliminate such redundant data structures, some program transformation techniques have been proposed. One such technique is shortcut fusion, and has been studied in the context of both pure and monadic functional programs. In this paper, we study several shortcut fusion extensions, so that, alternatively, circular or higher-order programs are derived. These extensions are also provided for effect-free programs and monadic ones. Our work results in a set of generic calculation rules, that are widely applicable, and whose correctness is formally established. © 2011 Springer Science+Business Media, LLC.

Idioma: Inglês

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