Exploiting algebra/coalgebra duality for program fusion extensions

Abstract

We reformulate algorithms for optimizing functional programs through a well known fusion technique. The reformulation sheds a new perspective which simplifies significantly the extensions to cope with programs involving mutually recursive definitions and recursion over multiple arguments. The presentation is based on a recursion scheme known as hylomorphism but other related fusion techniques may benefit from the results. Our algorithms are implemented as part of a fusion tool called HFusion.

Catamorphism Generation and Fusion Using Coq

“…The use of a theorem prover to provide a concrete implementation of these concepts can also be seen in [16], where the author uses PVS to apply hylomorphism fusion. As this particular fusion does not necessitate verifying preconditions, it has been used in entirely automatic tools targeting the language Haskell [17], [18]. In [19], the author describes the implementation of this type of fusion in a compiler for pH, an implicitly parallel dialect of Haskell.…”