Common subexpressions are uncommon in lazy functional languages

Cached

Download Links

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

Documents Related by Co-Citation

406 Deforestation: transforming programs to eliminate trees – P Wadler - 1988
347 How to make ad-hoc polymorphism less adhoc – Philip Wadler, Stephen Blott - 1989
52 Let-Floating: Moving Bindings to Give Faster Programs – Simon Peyton Jones, Will Partain, et al. - 1997
272 The essence of compiling with continuations – Cormac Flanagan, Amr Sabry, Bruce F Duba, Matthias Felleisen - 1993
195 A Short Cut to Deforestation – Andrew Gill, John Launchbury, Simon L Peyton Jones - 1993
187 Parameter-Passing and the Lambda Calculus – Erik Crank, Matthias Felleisen - 1991
185 Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine - Version 2.5 – Simon L Peyton Jones - 1992
179 Lambda Lifting: Transforming Programs to Recursive Equations – Thomas Johnsson - 1985
174 Partial Evaluation of Computation Process - An Approach to a Compiler-Compiler – Yoshihiko Futamura - 1999