Skip to main content
SpringerLink
Log in
Book cover

Programs as Data Objects pp 282–305Cite as

Listlessness is better than laziness II: Composing listless functions

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 217))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bellegarde, F. Convergent term rewriting systems can be used for program transformation. This volume.

    Google Scholar 

  2. Ganzinger, H. and Giegrich, R. Attribute coupled grammars. Proceedings of the ACM SIGPLAN Symposium on Compiler Construction. SIGPLAN Notices, 19(6). June, 1984.

    Google Scholar 

  3. Hughes, R.J.M. Lazy memo functions. Conference on Functional Programming Languages and Computer Architecture, Nancy, France. September, 1985.

    Google Scholar 

  4. Hughes, R.J.M. Strictness detection on non-flat domains. This volume.

    Google Scholar 

  5. Hughes, R.J.M. Why functional programming matters. Internal report, Programming Methodology Group, Chalmers Institute of Technology, Gothenburg, Sweden. 1985.

    Google Scholar 

  6. Johnsson, T. Efficient compilation of lazy evaluation. Proceedings of the ACM SIGPLAN Symposium on Compiler Construction. SIGPLAN Notices, 19(6). June, 1984.

    Google Scholar 

  7. Mont-Reynaud, B. Removing trivial assignments from programs. Stanford University, Dept. of Computer Science technical report STAN-CS-76-544. March, 1976.

    Google Scholar 

  8. Peyton Jones, S. Implementing Functional Languages by Graph Reduction. To appear.

    Google Scholar 

  9. Turner, D. Miranda: a lazy functional language with polymorphic types. Conference on Functional Programming Languages and Computer Architecture, Nancy, France. September, 1985.

    Google Scholar 

  10. Wadler, P.L. Applicative style programming, program transformation, and list operators. Conference on Functional Programming Languages and Computer Architecture, Portsmouth, New Hampshire. October, 1981.

    Google Scholar 

  11. Wadler, P.L. Listlessness is better than laziness: lazy evaluation and garbage collection at compile-time. ACM Symposium on Lisp and Functional Programming, Austin, Texas. August, 1984.

    Google Scholar 

  12. Wadler, P.L. Listlessness is Better than Laziness. Ph.D. Dissertation, Carnegie-Mellon University. August, 1984.

    Google Scholar 

  13. Wadler, P.L. An introduction to Orwell. Internal report, Programming Research Group, Oxford University. 1985.

    Google Scholar 

  14. Wadler, P.L. Strictness analysis on non-flat domains (by abstract interpretation over finite domains). To appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Programming Research Group, Oxford University, 11 Keble Road, OX1 3QD, Oxford

    Philip Wadler

Authors
  1. Philip Wadler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Harald Ganzinger Neil D. Jones

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wadler, P. (1986). Listlessness is better than laziness II: Composing listless functions. In: Ganzinger, H., Jones, N.D. (eds) Programs as Data Objects. Lecture Notes in Computer Science, vol 217. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16446-4_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-16446-4_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16446-3

  • Online ISBN: 978-3-540-39786-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation