Function Depth Hash Table Cyclic Structure Garbage Collection Functional Programming 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    H. Baker, "List Processing in Real-time on a Serial Computer", Communications of the ACM, Vol. 21 no. 4, pp. 280–294 (April 1978).Google Scholar
  2. [2]
    R. S. Bird, "Super-combinator Compilers: A Transformational Approach", Oxford University (1984).Google Scholar
  3. [3]
    R. S. Bird, "Private communication", 1984.Google Scholar
  4. [4]
    M. Coutts-Smith, "Expert Systems", MSc dissertation, Oxford University (1984).Google Scholar
  5. [5]
    D. P. Friedman and D. S. Wise, "Garbage collecting a heap that includes a scatter table", Information Processing Letters, Vol. 5 no. 6, pp. 161–164 (December 1976).Google Scholar
  6. [6]
    J. Hilden, "Elimination of recursive calls using a small table of ‘randomly’ selected function values", BIT, Vol. 16 no. 1, pp. 60–73 (1976).Google Scholar
  7. [7]
    J. Hughes, "Super Combinators — A New Implementation Method for Applicative Languages", pp. 1–10 in Proceedings of the 1982 ACM Symposium on Lisp and Functional Programming, Pittsburgh (1982).Google Scholar
  8. [8]
    R. J. M. Hughes, "The Design and Implementation of Programming Languages", Programming Research Group Technical Monograph PRG-40, Oxford University (1983), Thesis.Google Scholar
  9. [9]
    R.J.M. Hughes, "Why Functional Programming Matters", Memo 40, Programming Methodology Group, Chalmers University of Technology, Göteborg (1984).Google Scholar
  10. [10]
    T. Johnsson, "Efficient Compilation of Lazy Evaluation", pp. 58–69 in Proceedings of the SIGPLAN '84 Symposium on Compiler Construction, Montreal (June 1984).Google Scholar
  11. [11]
    T. Johnsson, "Lambda Lifting", Memo 41, Programming Methodology Group, Chalmers University of Technology, Göteborg (1984).Google Scholar
  12. [12]
    R. M. Keller and G. Lindstrom, "Parallelism in Functional Programming through Applicative Loops", University of Utah, Salt Lake City ().Google Scholar
  13. [13]
    R.M. Keller and M.R. Sleep, "Applicative caching: Programmer control of object sharing and lifetime in distributed implementations of applicative languages", pp. 131–140 in Proceedings of the ACM Conference on Functional Languages and Computer Architecture, Wentworth (1981).Google Scholar
  14. [14]
    D. Michie, "'Memo’ functions and machine learning", Nature, No. 218, pp. 19–22 (April 1968).Google Scholar
  15. [15]
    F. L. Morris, "On list structures and their use in the programming of unification", School of Computer and Information Science, Syracuse University (August 1978).Google Scholar
  16. [16]
    S. L. Peyton-Jones, "Private communication", October 1984.Google Scholar
  17. [17]
    E. H. Shortliffe, MYCIN: Computer-based Medical Consultations, Elsevier, New York (1976), based on a PhD thesis, Stanford University, 1974.Google Scholar
  18. [18]
    Spitzen and Levitt, Communications of the ACM, Vol. 21 no. 12, pp. 1064–1075 (December 1978).Google Scholar
  19. [19]
    D. A. Turner, "A New Implementation Technique for Applicative Languages", Software — Practice and Experience, Vol. 9, pp. 31–49 (1979).Google Scholar
  20. [20]
    D. A. Turner, "The Semantic Elegance of Applicative Languages" in Proceedings 1981 Conference on Functional Languages and Computer Architecture, Wentworth-by-the-Sea, Portsmouth, New Hampshire (October 1981).Google Scholar
  21. [21]
    D. A. Turner, "Recursion Equations as a Programming Language", pp. 1–10 in Functional Programming and its Applications, ed. D. A. Turner, Cambridge University Press, Cambridge (1982).Google Scholar
  22. [22]
    D. S. Wise, Abacus, Vol. 2 no. 2, pp. 20–32 (Winter 1985).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • John Hughes
    • 1
  1. 1.Programming Methodology Group Department of Computer ScienceChalmers University of TechnologyGöteborgSweden

Personalised recommendations