A functional correspondence between call-by-need evaluators and lazy abstract machines

Information Processing Letters

Volumn 90, Issue 5, 2004, Pages 223-232

  Ager, Mads Sig ^a   Danvy, Olivier ^a   Midtgaard, Jan ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Abstract machines; Closure conversion; CPS transformation; Defunctionalization; Functional programming; Interpreters; Program derivation

Indexed keywords

COMPUTER PROGRAMMING; DIFFERENTIATION (CALCULUS); FUNCTIONS; MATHEMATICAL TRANSFORMATIONS; PROGRAM INTERPRETERS; SEMANTICS;

ABSTRACT MACHINES; CLOSURE CONVERSION; CPS TRANSFORMATION; DEFUNCTIONALIZATION; FUNCTIONAL PROGRAMMING; PROGRAM DERIVATION;

DATA PROCESSING;

EID: 2142844803     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.02.012     Document Type: Article

References (29)

1. Ager M.S., Biernacki D., Danvy O., Midtgaard J. A functional correspondence between evaluators and abstract machines. Miller D. Proceedings of the Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP'03). 2003;8-19 ACM Press, New York.
2. M.S. Ager, O. Danvy, J. Midtgaard, A functional correspondence between monadic evaluators and abstract machines for languages with computational effects, Technical Report BRICS RS-03-35, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, 2003.
3. Appel A.W. Modern Compiler Implementation in {C, Java, ML}. 1998;Cambridge University Press, New York.
4. Ariola Z.M., Felleisen M., Maraist J., Odersky M., Wadler P. The call-by-need lambda calculus. Lee P. Proceedings of the Twenty-Second Annual ACM Symposium on Principles of Programming Languages, San Francisco, CA. 1995;233-246 ACM Press, New York.
5. Banerjee A., Heintze N., Riecke J.G. Design and correctness of program transformations based on control-flow analysis. Kobayashi N., Pierce B.C. Theoretical Aspects of Computer Software, 4th International Symposium, TACS 2001, Sendai, Japan. Lecture Notes in Computer Science. vol. 2215:2001;420-447 Springer, Berlin.
6. Crégut P. An abstract machine for lambda-terms normalization. Wand M. Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, Nice, France. 1990;333-340 ACM Press, New York.
7. O. Danvy, A rational deconstruction of Landin's SECD machine, Technical Report BRICS RS-03-33, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, 2003.
8. Danvy O., Hatcliff J. On the transformation between direct and continuation semantics. Brookes S., Main M., Melton A., Mislove M., Schmidt D. Proceedings of the 9th Conference on Mathematical Foundations of Programming Semantics, New Orleans, LA. Lecture Notes in Computer Science. vol. 802:1993;627-648 Springer, Berlin.
9. Danvy O., Nielsen L.R. Defunctionalization at work. Søndergaard H. Proceedings of the Third International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'01), Firenze, Italy. 2001;162-174 ACM Press, New York.
10. Diehl S., Hartel P., Sestoft P. Abstract machines for programming language implementation. Future Generation Computer Systems. 16:2000;739-751.
11. Fairbairn J., Wray S. TIM: a simple, lazy abstract machine to execute supercombinators. Kahn G. Functional Programming Languages and Computer Architecture, Portland, OR. Lecture Notes in Computer Science. vol. 274:1987;34-45 Springer, Berlin.
12. D.P. Friedman, A. Ghuloum, J.G. Siek, L. Winebarger, Improving the lazy Krivine machine, Higher-Order and Symbolic Computation (2004), in press.
13. Friedman D.P., Wand M., Haynes C.T. Essentials of Programming Languages. second ed. 2001;MIT Press, Cambridge, MA.
14. Friedman D.P., Wise D.S. CONS should not evaluate its arguments. Michaelson S., Milner R. Third International Colloquium on Automata, Languages, and Programming. 1976;257-284 Edinburgh University Press, Edinburgh, Scotland.
15. Hannan J., Miller D. From operational semantics to abstract machines. Math. Struct. Comput. Sci. 2:(4):1992;415-459.
16. Hardin T., Maranget L., Pagano B. Functional runtime systems within the lambda-sigma calculus. J. Funct. Programming. 8:(2):1998;131-172.
17. Henderson P., Morris J.H. Jr. A lazy evaluator. Graham S.L. Proceedings of the Third Annual ACM Symposium on Principles of Programming Languages. 1976;95-103 ACM Press, New York.
18. Johnsson T. Fold-unfold transformations on state monadic interpreters. Hammond K., Turner D.N., Sansom P.M. Proceedings of the 1994 Glasgow Workshop on Functional Programming, Workshops in Computing, Ayr, Scotland. 1994;Springer, Berlin.
19. Josephs M.B. The semantics of lazy functional languages. Theoret. Comput. Sci. 68:1989;105-111.
20. Landin P.J. The mechanical evaluation of expressions. Comput. J. 6:(4):1964;308-320.
21. Launchbury J. A natural semantics for lazy evaluation. Graham S.L. Proceedings of the Twentieth Annual ACM Symposium on Principles of Programming Languages, Charleston, SC. 1993;144-154 ACM Press, New York.
22. L.R. Nielsen, A denotational investigation of defunctionalization, Technical Report BRICS RS-00-47, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, 2000.
23. Plotkin G.D. Call-by-name, call-by-value and the λ -calculus. Theoret. Comput. Sci. 1:1975;125-159.
24. Randell B., Russell L.J. ALGOL 60 Implementation. 1964;Academic Press, New York.
25. Reynolds J.C. Definitional interpreters for higher-order programming languages. Higher-Order and Symbolic Computation. 11:(4):1998;363-397. Reprinted from the Proceedings of the 25th ACM National Conference (1972), with a foreword.
26. Reynolds J.C. Definitional interpreters for higher-order programming languages. Higher-Order and Symbolic Computation. 11:(4):1998;363-397. Reprinted from the Proceedings of the 25th ACM National Conference (1972), with a foreword.
27. Sestoft P. Deriving a lazy abstract machine. J. Funct. Programming. 7:(3):1997;231-264.
28. Vuillemin J. Correct and optimal implementations of recursion in a simple programming language. J. Comput. System Sci. 9:(3):1974;332-354.
29. Wilhelm R., Maurer D. Compiler Design. 1995;Addison-Wesley, Reading, MA.