14 search results - page 2 / 3 » Shortcut Fusion of Monadic Programs |
APLAS
2009
ACM
13 years 10 months ago
2009
ACM
We propose a method for easily developing efficient programs for finding optimal sequences, such as the maximum weighted sequence of a set of feasible ones. We formalize a way to ...
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...
FLOPS
2008
Springer
13 years 5 months ago
2008
Springer
We study various shortcut fusion rules for languages like Haskell. Following a careful semantic account of a recently proposed rule for circular program transformation, we propose ...
FPCA
1995
13 years 7 months ago
1995
In functional programming, intermediate data structures are often used to “glue’) together small programs. Deforestation is a program transformation to remove these intermedia...
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...