This work was in part performed at Oxford University, under a research fellowship fudned by ICL.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
L. Augustsson, Compiling pattern matching. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture, Nancy, France, September 1985. LNCS 201, Springer-Verlag, 1985.
L. Augustsson, Compiling lazy functional languages, Part II. Ph.D. dissertation, Department of Computer Science, Chalmers Tekniska Högskola, Göteborg, Sweden, 1987.
R. M. Burstall and J. Darlington, A transformation system for developing recursive programs. Journal of the ACM, 24(1):44–67, January 1977.
M. K. Davis, Deforestation: Transformation of functional programs to eliminate intermediate trees. M.Sc. dissertation, Programming Research Group, Oxford University, September 1987.
L. Damas and R. Milner, Principal type schemes for functional programs. In Proceedings of the ACM Symposium on Principles of Programming Languages, January 1982.
T. Johnsson, Compiling lazy functional languages. Ph.D. dissertation, Department of Computer Science, Chalmers Tekniska Högskola, Göteborg, Sweden, 1987.
P. Hancock, Polymorphic type-checking. In [Pey87].
R. Milner, A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17:348–375, 1978.
S. L. Peyton Jones, The Implementation of Functional Programming Languages, Prentice Hall, 1987.
D. A. Turner, Miranda: A non-strict functional language with polymorphic types. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture, Nancy, France, September 1985. LNCS 201, Springer-Verlag, 1985.
P. L. Wadler, Listlessness is better than laziness: Lazy evaluation and garbage collection at compile-time. In Proceedings of the ACM Symposium on Lisp and Functional Programming, Austin, Texas, August 1984.
P. L. Wadler, Listlessness is better than laziness II: Composing listless functions. In Proceedings of the Workshop on Programs as Data Objects, Copenhagen, October 1985. LNCS 217, Springer-Verlag, 1985.
P. L. Wadler, Efficient compilation of pattern-matching. In [Pey87].
P. L. Wadler, The concatenate vanishes. Note distributed to FP electronic mailing list, December 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wadler, P. (1988). Deforestation: Transforming programs to eliminate trees. In: Ganzinger, H. (eds) ESOP '88. ESOP 1988. Lecture Notes in Computer Science, vol 300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19027-9_23
Download citation
DOI: https://doi.org/10.1007/3-540-19027-9_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19027-1
Online ISBN: 978-3-540-38941-5
eBook Packages: Springer Book Archive