|
375
|
Deforestation: Transforming programs to eliminate trees
– Philip Wadler
- 1990
|
|
533
|
A Transformation System for Developing Recursive Programs
– R. M. Burstall, John Darlington
- 1977
|
|
27
|
Proving the Correctness of Recursion-Based Automatic Program Transformations
– David Sands
- 1996
|
|
40
|
A Naïve Time Analysis and its Theory of Cost Equivalence
– David Sands
- 1995
|
|
19
|
Operational Theories of Improvement in Functional Languages (Extended Abstract)
– David Sands
- 1991
|
|
35
|
Safe fusion of functional expressions II: Further improvements
– Wei-Ngan Chin
- 1994
|
|
173
|
A Short Cut to Deforestation
– Andrew Gill, John Launchbury, Simon L Peyton Jones
- 1993
|
|
201
|
Unfold/Fold Transformation of Logic Programs
– Hisao Tamaki, Taisuke Sato
- 1984
|
|
31
|
Improvement in a Lazy Context: An Operational Theory for Call-By-Need
– Andrew Moran, David Sands
- 1999
|
|
169
|
A Natural Semantics for Lazy Evaluation
– John Launchbury
- 1993
|
|
29
|
Benefits of Tree Transducers for Optimizing Functional Programs
– Armin Kühnemann
- 1998
|
|
17
|
Comparison of Deforestation Techniques for Functional Programs and for Tree Transducers
– Armin Kühnemann
- 1999
|
|
20
|
Composition of functions with accumulating parameters
– Janis Voigtländer, Armin Kühnemann
- 2004
|
|
76
|
Automatic complexity analysis
– M Rosendahl
- 1989
|
|
69
|
On perfect supercompilation
– Jens Peter Secher, Morten Heine Sørensen
- 1996
|
|
155
|
The Concept of a Supercompiler
– Valentin F. Turchin
- 1986
|
|
68
|
Rules and Strategies for Transforming Functional and Logic Programs
– A. Pettorossi, M. Proietti, R. Dicembre
- 1996
|
|
70
|
Warm Fusion: Deriving Build-Catas from Recursive Definitions
– John Launchbury, Tim Sheard
- 1995
|
|
515
|
D.: Implementation of Functional Programming Languages
– Peyton Jones, S Lester
- 1987
|
