Efficient compilation of lasy evaluation

Proceedings of the 1984 SIGPLAN Symposium on Compiler Construction, SIGPLAN 1984

Volumn , Issue , 1984, Pages 58-69

  Johnsson, Thomas ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS);

EFFICIENT IMPLEMENTATION; GRAPH REDUCTION; LAZY FUNCTIONAL LANGUAGES; MACHINE INSTRUCTIONS; ORDERS OF MAGNITUDE; REWRITE RULES; SPEED IMPROVEMENT; USER DEFINED FUNCTIONS;

PROGRAM COMPILERS;

EID: 84987233552     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/502874.502880     Document Type: Conference Paper

References (17)

1. L. Augustsson, "FC manual", Memo 13, Programming Methodology Group, Chalmers university of Technology, Goteborg (1982).
2. J. Backus, "Can Programming he Liberated from the von Neumann Style? A funtional style and its algebra of programs", Comm. ACM, Vol. 21 no. 8 pp. 613-641 (August 1978).
3. L. Cardelli, "ML under UNIX", Polymorphism: The ML/LCF./Hope Newsletter, Vol. 1 no, 3 (January 1984).
4. H. Fenichel and J. Yocheleon, "A LISP garbage-collector for virtual memory computer systems", Comm. of the ACM, Vol. 12 no. 11 pp. 611-612 (November 1969).
5. D. P. Friedman and D. S. Wise, "Cons should not evaluate its arguments", pp. 257-284 in Automata, Languages and Programming, Edinburgh Univ. Press (1976).
6. M. Gordon, R. Milner, and C. Wadaworth, "Edinburgh LCF", Lecture Botes in Computer Science, Vol. 78, Springer Verlag (1979).
7. P. Hudak and D. Krane, "A Combinator-baeed Compiler for a Functional Language", pp. 122-132 in Proc. 11th ACM Symp. on Principles of Programming Languages (1984).
8. J. Hughes, "Super Combin & Torsi A New Implementation Method for Applicative Languages", pp. 1-10 in Proceedings of the 1982 ACH Symposium on Lisp and Functional Programming, Pittsburgh (1982).
9. T. Johnsson, "Code Generation for Lasy Evaluation", Memo 22, Programming Methodology Group, Chalmers University of Technology, Goteborg (1981).
10. N.B. Jones and S.S. Kuchnick, "A Fixed-Program Machine for Combinator Expression Evaluation", pp. 11-20 in Proceedings of the 1962 ACM Symposium on Lisp and Functional Programming, Pittsburgh (1982).
11. P. J. Landin, "The Mechanical Evaluation of Expressions", Computer Journal, No. 6 pp. 308-320 (January 1964).
12. P. J. Landin, "The Next 700 Programming Languages", Comm. of the ACM, Vol. 9 no. 3 pp. 157-164 (March 1966).
13. R. Milner, "A Theory of Type Polymorphism in Programming", Journal of Computer and System Sciences, Vol. 17 no. 3 pp. 348-375 (1978).
14. R. Milner, "Standard ML Proposal", Polymorphism: The ML/LCF/Hope Hewaletter, Vol. 1 no. 3 (January 1984).
15. A. Mycroft, "The Theory and Practice of Transforming Call-by-Need into Call-by-value", pp. 269-281 in Proc. 4th Int. Symp. on Programming, Lecture Motes in Computer Science, Vol. 83, Springer Verlag, Paris (April 1980).
16. D. A. Turner, "An implementation of SASL", TR/75/4, St. Andrews (1975).
17. D. A. Turner, "Hew Implementation Techniques for Applicative Languages", Software - Practice and Experience, Vol. 9 pp. 31-49 (1979).