A shortcut fusion rule for circular program calculation
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,...
Main Author: | |
---|---|
Other Authors: | , |
Format: | conferencePaper |
Language: | eng |
Published: |
2007
|
Subjects: | |
Online Access: | http://hdl.handle.net/1822/36104 |
Country: | Portugal |
Oai: | oai:repositorium.sdum.uminho.pt:1822/36104 |