Common subexpressions are uncommon in lazy functional languages

View PDF

Download Links

by Olaf Chitil
Venue:Implementation of Functional Languages, 9th International Workshop, IFL’97
Citations:3 - 0 self

Documents Related by Co-Citation

56 Let-Floating: Moving Bindings to Give Faster Programs – Simon Peyton Jones, Will Partain, et al. - 1997
424 Deforestation: Transforming programs to eliminate trees – P Wadler - 1990
280 The essence of compiling with continuations – C Flanagan, A Sabry, B F Duba, M Felleisen - 1993
204 Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine - Version 2.5 – Simon L Peyton Jones - 1992
202 A Short Cut to Deforestation – Andrew Gill, John Launchbury, Simon L Peyton Jones - 1993
186 Lambda Lifting: Transforming Programs to Recursive Equations – Thomas Johnsson - 1985
178 Partial Evaluation of Computation Process - An Approach to a Compiler-Compiler – Yoshihiko Futamura - 1999
139 98 Language and Libraries: The Revised Report – Haskell - 2003
358 How to make ad-hoc polymorphism less ad hoc – P Wadler, S Blott - 1989