Advertisement

Listlessness is better than laziness II: Composing listless functions

  • Philip Wadler
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 217)

Keywords

Input Step Graph Reducer Input List Primitive Variable Interface Node 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bellegarde 85]
    Bellegarde, F. Convergent term rewriting systems can be used for program transformation. This volume.Google Scholar
  2. [Ganzinger and Giegrich 84]
    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 85a]
    Hughes, R.J.M. Lazy memo functions. Conference on Functional Programming Languages and Computer Architecture, Nancy, France. September, 1985.Google Scholar
  4. [Hughes 85b]
    Hughes, R.J.M. Strictness detection on non-flat domains. This volume.Google Scholar
  5. [Hughes 85c]
    Hughes, R.J.M. Why functional programming matters. Internal report, Programming Methodology Group, Chalmers Institute of Technology, Gothenburg, Sweden. 1985.Google Scholar
  6. [Johnsson 84]
    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 76]
    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 86]
    Peyton Jones, S. Implementing Functional Languages by Graph Reduction. To appear.Google Scholar
  9. [Turner 85]
    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 81]
    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 84a]
    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 84b]
    Wadler, P.L. Listlessness is Better than Laziness. Ph.D. Dissertation, Carnegie-Mellon University. August, 1984.Google Scholar
  13. [Wadler 85a]
    Wadler, P.L. An introduction to Orwell. Internal report, Programming Research Group, Oxford University. 1985.Google Scholar
  14. [Wadler 85b]
    Wadler, P.L. Strictness analysis on non-flat domains (by abstract interpretation over finite domains). To appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Philip Wadler
    • 1
  1. 1.Programming Research GroupOxford UniversityOxford

Personalised recommendations