%0 Conference Paper
%B Haskell Workshop
%D 2007
%T A shortcut fusion rule for circular program calculation
%A João Paulo Fernandes
%A Alberto Pardo
%A João Alexandre Saraiva
%C Freiburg, Germany
%P 95-106
%X <p>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.</p>
%8 September
%> https://haslab.uminho.pt/sites/default/files/jpaulo/files/hw07.pdf