Deforestation for Higher-Order Functional Programs (1995)

Cached

Download Links

by Simon David Marlow
Citations:19 - 0 self

Active Bibliography

32 Compilation by Transformation in Non-Strict Functional Languages – AndrĂ© L. de M. Santos - 1995
55 Compiling Haskell by program transformation: a report from the trenches – Simon L. Peyton Jones - 1996
82 A transformation-based optimiser for Haskell – Simon L. Peyton Jones, AndrĂ© L M Santos - 1998
54 Computational types from a logical perspective – P. N. Benton, G. M. Bierman, V. C. V. De Paiva - 1998
1 Algebraic fusion of functions with an accumulating parameter and its improvement – Shin-ya Katsumata - 2006
1 Warm Fusion for the Masses: Detailing Virtual Data Structure Elimination in Fully Recursive Languages – Patricia Johann, John Launchbury - 1997
11 How to Comprehend Queries Functionally – Torsten Grust, Marc H. Scholl - 1999
Execution Profiling for . . . – Patrick M. Sansom - 1994
6 Computing Science – Ph Thesis, Patrick M. Sansom, Patrick M. Sansom - 1994
195 A Short Cut to Deforestation – Andrew Gill, John Launchbury, Simon L Peyton Jones - 1993
49 Merging Monads and Folds for Functional Programming – Erik Meijer, Johan Jeuring - 1995
1 A Programming Language for Probabilistic Computation – Sungwoo Park, Geoffrey Gordon, Robert Harper - 2005
97 How to Declare an Imperative – Philip Wadler - 1995
92 Polytypic programming – Patrik Jansson - 2000
458 Comprehending Monads – Philip Wadler - 1992
2 Comprehending Queries – Torsten Grust - 1999
20 Algebra of logic programming – Silvija Seres - 1999
51 Let-Floating: Moving Bindings to Give Faster Programs – Simon Peyton Jones, Will Partain, et al. - 1997
Explicit Binds: Effortless Efficiency with and without Trees – Tarmo Uustalu