Advertisement

Deforestation: Transforming programs to eliminate trees

  • Philip Wadler
5. Implementation Of Programming Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 300)

Keywords

Function Definition Program Transformation Intermediate Tree Polymorphic Type Case Term 
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

  1. [Aug85]
    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.Google Scholar
  2. [Aug87]
    L. Augustsson, Compiling lazy functional languages, Part II. Ph.D. dissertation, Department of Computer Science, Chalmers Tekniska Högskola, Göteborg, Sweden, 1987.Google Scholar
  3. [BD77]
    R. M. Burstall and J. Darlington, A transformation system for developing recursive programs. Journal of the ACM, 24(1):44–67, January 1977.CrossRefGoogle Scholar
  4. [Dav87]
    M. K. Davis, Deforestation: Transformation of functional programs to eliminate intermediate trees. M.Sc. dissertation, Programming Research Group, Oxford University, September 1987.Google Scholar
  5. [DM82]
    L. Damas and R. Milner, Principal type schemes for functional programs. In Proceedings of the ACM Symposium on Principles of Programming Languages, January 1982.Google Scholar
  6. [Joh87]
    T. Johnsson, Compiling lazy functional languages. Ph.D. dissertation, Department of Computer Science, Chalmers Tekniska Högskola, Göteborg, Sweden, 1987.Google Scholar
  7. [Han87]
    P. Hancock, Polymorphic type-checking. In [Pey87].Google Scholar
  8. [Mil78]
    R. Milner, A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17:348–375, 1978.CrossRefGoogle Scholar
  9. [Pey87]
    S. L. Peyton Jones, The Implementation of Functional Programming Languages, Prentice Hall, 1987.Google Scholar
  10. [Tur85]
    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.Google Scholar
  11. [Wad84]
    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.Google Scholar
  12. [Wad85]
    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.Google Scholar
  13. [Wad87a]
    P. L. Wadler, Efficient compilation of pattern-matching. In [Pey87].Google Scholar
  14. [Wad87b]
    P. L. Wadler, The concatenate vanishes. Note distributed to FP electronic mailing list, December 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Philip Wadler
    • 1
  1. 1.Department of Computing ScienceUniversity of GlasgowGlasgowScotland

Personalised recommendations