A Shortcut Fusion Rule for Circular Program Calculation

• Type: Article in International Conference Proceedings Book
• Date: 2007

Authors

Joao Paulo Fernandes (Author) FEUP; Alberto Pardo (Author) Other; Joao Saraiva (Author) Other

Conference proceedings International

Title: HASKELL'07: PROCEEDINGS OF THE ACM SIGPLAN 2007 HASKELL WORKSHOP

Pages: 95-106

11th ACM SIGPLAN Haskell Workshop

Freiburg, GERMANY, SEP 30, 2007

Indexing

ISI Web of Knowledge - 12 Citations

Scopus - 18 Citations

Scientific classification

FOS: Natural sciences > Computer and information sciences

Other information

Authenticus ID: P-004-D9X

DOI: 10.1145/1291201.1291216

Abstract (EN): Circular programs are a powerful technique to express multiple traversal algorithms as a single traversal function in a lazy setting. In this paper, we present a shortcut deforestation technique to calculate circular programs. The technique we propose takes as input the composition of two functions, such that the first builds an intermediate structure and some additional context information which are then processed by the second one, to produce the final result. Our transformation into circular programs achieves intermediate structure deforestation and multiple traversal elimination. Furthermore, the calculated programs preserve the termination properties of the original ones.

Language: English

Type (Professor's evaluation): Scientific

Notes: ACM Press

No. of pages: 12