J. Launchbury. Graph Algorithms with a Functional Flavor. In Proceedings, First International Spring School on Advanced Functional Programming, Springer-Verlag, pp. 308 -- 331, 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....programs) Whether or not this is always, or even often, a win remains to be discerned. Draft, June 22, 1998 49 3. Extensions All existing fusion methods as well as the theoretical work underlying them restrict attention to programs written in pure functional languages. Recent research ([Lau95], Joh94] suggests that fusion techniques can be extended to functional programs written in monadic style, especially to those written using the monad of state. This in turn suggests that build cata fusion can be lifted to imperative programs. It may also be possible to extend fusion to programs ....

J. Launchbury. Graph Algorithms with a Functional Flavor. In Proceedings, First International Spring School on Advanced Functional Programming, Springer-Verlag, pp. 308 -- 331, 1995.

....accommodate the fused functions) Whether or not this is always, or even often, a win remains to be discerned. 3. Extensions All existing fusion methods as well as the theoretical work underlying them restrict attention to programs written in pure functional languages. Recent research ([Lau95], Joh94] suggests that fusion techniques can be extended to functional programs written in monadic style, especially to those written using the monad of state. This in turn suggests that build cata fusion can be lifted to imperative programs. It may also be possible to extend fusion to programs ....

J. Launchbury. Graph Algorithms with a Functional Flavor. In Proceedings, First International Spring School on Advanced Functional Programming, Springer-Verlag, pp. 308 -- 331, 1995. 46

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC