6 search results - page 1 / 2 » Fusion with stacks and accumulating parameters |
PEPM
2004
ACM
13 years 10 months ago
2004
ACM
We propose a new algorithm for fusion transformation that allows both stacks and accumulating parameters. The new algorithm can fuse programs that cannot be handled by existing fu...
ICFP
2002
ACM
14 years 4 months ago
2002
ACM
We present an alternative approach to shortcut fusion based on the function unfoldr. Despite its simplicity the technique can remove intermediate lists in examples which are known...
ICFP
2006
ACM
14 years 4 months ago
2006
ACM
We present a unifying solution to the problem of fusion of functions, where both the producer function and the consumer function have one accumulating parameter. The key idea in t...
LOPSTR
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...
POPL
2007
ACM
14 years 4 months ago
2007
ACM
This paper proposes a lightweight fusion method for general recursive function definitions. Compared with existing proposals, our method has several significant practical features...