uucp: ..!mcvax!enea!chalmers!john
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
H. Baker, "List Processing in Real-time on a Serial Computer", Communications of the ACM, Vol. 21 no. 4, pp. 280–294 (April 1978).
R. S. Bird, "Super-combinator Compilers: A Transformational Approach", Oxford University (1984).
R. S. Bird, "Private communication", 1984.
M. Coutts-Smith, "Expert Systems", MSc dissertation, Oxford University (1984).
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).
J. Hilden, "Elimination of recursive calls using a small table of ‘randomly’ selected function values", BIT, Vol. 16 no. 1, pp. 60–73 (1976).
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).
R. J. M. Hughes, "The Design and Implementation of Programming Languages", Programming Research Group Technical Monograph PRG-40, Oxford University (1983), Thesis.
R.J.M. Hughes, "Why Functional Programming Matters", Memo 40, Programming Methodology Group, Chalmers University of Technology, Göteborg (1984).
T. Johnsson, "Efficient Compilation of Lazy Evaluation", pp. 58–69 in Proceedings of the SIGPLAN '84 Symposium on Compiler Construction, Montreal (June 1984).
T. Johnsson, "Lambda Lifting", Memo 41, Programming Methodology Group, Chalmers University of Technology, Göteborg (1984).
R. M. Keller and G. Lindstrom, "Parallelism in Functional Programming through Applicative Loops", University of Utah, Salt Lake City ().
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).
D. Michie, "'Memo’ functions and machine learning", Nature, No. 218, pp. 19–22 (April 1968).
F. L. Morris, "On list structures and their use in the programming of unification", School of Computer and Information Science, Syracuse University (August 1978).
S. L. Peyton-Jones, "Private communication", October 1984.
E. H. Shortliffe, MYCIN: Computer-based Medical Consultations, Elsevier, New York (1976), based on a PhD thesis, Stanford University, 1974.
Spitzen and Levitt, Communications of the ACM, Vol. 21 no. 12, pp. 1064–1075 (December 1978).
D. A. Turner, "A New Implementation Technique for Applicative Languages", Software — Practice and Experience, Vol. 9, pp. 31–49 (1979).
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).
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).
D. S. Wise, Abacus, Vol. 2 no. 2, pp. 20–32 (Winter 1985).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hughes, J. (1985). Lazy memo-functions. In: Jouannaud, JP. (eds) Functional Programming Languages and Computer Architecture. FPCA 1985. Lecture Notes in Computer Science, vol 201. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15975-4_34
Download citation
DOI: https://doi.org/10.1007/3-540-15975-4_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15975-9
Online ISBN: 978-3-540-39677-2
eBook Packages: Springer Book Archive