A functional correspondence between monadic evaluators and abstract machines for languages with computational effects

Theoretical Computer Science

Volumn 342, Issue 1, 2005, Pages 149-172

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

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

calculus; Abstract machines; Closure conversion; Defunctionalization; Effects; Interpreters; Monads; Proper tail recursion; Stack inspection; Transformation into continuation passing style (CPS)

Indexed keywords

COMPUTATIONAL METHODS; ERROR ANALYSIS; FUNCTIONS; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; PARAMETER ESTIMATION;

ABSTRACT MACHINES; CALCULUS; COMPUTATIONAL EFFECTS; TAIL-RECURSIVE STACKS;

MATHEMATICAL TECHNIQUES;

EID: 23844517416     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.06.008     Document Type: Article

References (38)

1. M. Abadì, and C. Fournet Access control based on execution history V. Gligor M. Reiter Proc. of the 10th Annu. Network and Distributed System Security Symp. (NDSS'03) San Diego, California February 2003 Internet Society 107 121
2. M.S. Ager, D. Biernacki, O. Danvy, J. Midtgaard, From interpreter to compiler and virtual machine: a functional derivation, Technical Report BRICS RS-03-14, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, March 2003.
3. M.S. Ager, D. Biernacki, O. Danvy, and J. Midtgaard A functional correspondence between evaluators and abstract machines D. Miller Proc. of the Fifth ACM-SIGPLAN Internat. Conf. on Principles and Practice of Declarative Programming (PPDP'03) August 2003 ACM Press New York 8 19
4. M.S. Ager, O. Danvy, and J. Midtgaard A functional correspondence between call-by-need evaluators and lazy abstract machines Inform. Process. Lett. 90 5 2004 223 232 (Extended version available as the technical report BRICS-RS-04-3)
5. M.S. Ager, O. Danvy, J. Midtgaard, A functional correspondence between monadic evaluators and abstract machines for languages with computational effects (extended version), Technical Report BRICS RS-04-28, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, December 2004.
6. N. Benton, J. Hughes, E. Moggi, Monads and effects, in: G. Barthe, P. Dybjer, L. Pinto, J. Saraiva (Eds.), Applied Semantics - Advanced Lectures, Vol. 2395, Lecture Notes in Computer Science, Caminha, Portugal, Springer, Berlin, September 2000, pp. 42-122.
7. D. Biernacki, O. Danvy, From interpreter to logic engine by defunctionalization, in: M. Bruynooghe (Ed.), Logic Based Program Synthesis and Transformation, 13th Internat. Symp., LOPSTR 2003, Vol. 3018, Lecture Notes in Computer Science, Uppsala, Sweden, Springer, Berlin, August 2003, pp. 143-159.
8. J. Clements, M. Felleisen, A tail-recursive semantics for stack inspections, in: P. Degano (Ed.), Programming Languages and Systems, 12th European Symp. on Programming, ESOP 2003, Vol. 2618, Lecture Notes in Computer Science, Warsaw, Poland, Springer, Berlin, April 2003, pp. 22-37.
9. W.D. Clinger Proper tail recursion and space efficiency K.D. Cooper Proc. of the ACM SIGPLAN'98 Conf. on Programming Languages Design and Implementation Montréal, Canada June 1998 ACM Press New York 174 185
10. O. Danvy, A rational deconstruction of Landin's SECD machine, in: C. Grelck, F. Huch, G.J. Michaelson, P. Trinder (Eds.), Implementation and Application of Functional Languages, 16th Internat. Workshop, IFL'04, Vol. 3474, Lecture Notes in Computer Science, Lübeck, Germany, Springer, Berlin, September 2004, pp. 52-71 (Extended version available as the technical report BRICS-RS-03-33).
11. O. Danvy, and A. Filinski Representing control, a study of the CPS transformation Math. Struct. Comput. Sci. 2 4 1992 361 391
12. O. Danvy, and L.R. Nielsen Defunctionalization at work H. Søndergaard Proc. of the Third Internat. ACM SIGPLAN Conf. on Principles and Practice of Declarative Programming (PPDP'01) Firenze, Italy September 2001 ACM Press New York 162 174 (Extended version available as the technical report BRICS RS-01-23)
13. O. Danvy, L.R. Nielsen, Refocusing in reduction semantics, Technical Report BRICS RS-04-26, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, November 2004. A preliminary version appears in the informal Proc. of the Second Internat. Workshop on Rule-Based Programming (RULE 2001), Electronic Notes in Theoretical Computer Science, Vol. 59.4.
14. O. Danvy, and U.P. Schultz Lambda-lifting in quadratic time J. Funct. Logic Programming 10 1 2004 (Available online at http://danae.uni-muenster.de/ lehre/kuchen/JFLP/ )
15. S. Diehl, P. Hartel, and P. Sestoft Abstract machines for programming language implementation Future Generation Comput. Systems 16 2000 739 751
16. M. Felleisen, M. Flatt, Programming languages and lambda calculi. Unpublished lecture notes. http://www.ccs.neu.edu/home/matthias/3810-w02/ readings.html, 1989-2003.
17. M. Felleisen, and D.P. Friedman Control operators, the SECD machine, and the λ -calculus M. Wirsing Formal Description of Programming Concepts III 1986 Elsevier Science Publishers B.V. North-Holland, Amsterdam 193 217
18. A. Filinski Representing monads H.-J. Boehm Proc. of the Twenty-First Annu. ACM Symp. on Principles of Programming Languages Portland, Oregon January 1994 ACM Press New York 446 457
19. C. Flanagan, A. Sabry, B.F. Duba, M. Felleisen, The essence of compiling with continuations, in: D.W. Wall (Ed.), Proc. of the ACM SIGPLAN'93 Conf. on Programming Languages Design and Implementation, SIGPLAN Notices, Vol. 28(6), Albuquerque, New Mexico, ACM Press, New York, June 1993, pp. 237-247.
20. C. Fournet, and A.D. Gordon Stack inspection: theory and variants ACM Trans. Programming Languages Systems 25 3 2003 360 399
21. D.P. Friedman, M. Wand, and C.T. Haynes Essentials of Programming Languages second ed. 2001 MIT Press Cambridge, MA
22. L. Gong, and R. Schemers Implementing protection domains in Java Development Kit 1.2 Proc. of the Internat. Symp. on Network and Distributed System Security San Diego, California March 1998
23. P.T. Graunke, R.B. Findler, S. Krishnamurthi, and M. Felleisen Automatically restructuring programs for the web M.S. Feather M. Goedicke 16th IEEE Internat. Conf. on Automated Software Engineering (ASE 2001) Coronado Island, San Diego, California, USA November 2001 IEEE Computer Society Silver Spring, MD 211 222
24. T. Johnsson, Lambda lifting: transforming programs to recursive equations, in: J.-P. Jouannaud (Ed.), Functional Programming Languages and Computer Architecture, Vol. 201, Lecture Notes in Computer Science, Nancy, France, Springer, Berlin, September 1985, pp. 190-203.
25. P.J. Landin The mechanical evaluation of expressions The Comput. J. 6 4 1964 308 320
26. T. Lindholm, and F. Yellin The Java TM Virtual Machine Specification second ed. 1999 Addison-Wesley Reading, MA
27. R. Milner, M. Tofte, R. Harper, and D. MacQueen The Definition of Standard ML (Revised) 1997 MIT Press Cambridge, MA
28. E. Moggi Notions of computation and monads Inform. and Comput. 93 1991 55 92
29. G.D. Plotkin Call-by-name, call-by-value and the λ -calculus Theoret. Comput. Sci. 1 1975 125 159
30. G.D. Plotkin, A structural approach to operational semantics, Technical Report FN-19, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, September 1981.
31. C. Queinnec Lisp in Small Pieces 1996 Cambridge University Press Cambridge
32. J.D. Ramsdell The tail-recursive SECD machine J. Automated Reasoning 23 1 1999 43 62
33. J.C. Reynolds Definitional interpreters for higher-order programming languages Higher-Order and Symbolic Comput. 11 4 1998 363 397 Reprinted from the Proc. of the 25th ACM National Conf. 1972, with a foreword
34. D.A. Schmidt, State transition machines for lambda calculus expressions, in: N.D. Jones (Ed.), Semantics-Directed Compiler Generation, Vol. 94, Lecture Notes in Computer Science, Aarhus, Denmark, Springer, Berlin, 1980, pp. 415-440.
35. G.L. Steele Jr., Rabbit: a compiler for scheme, Master's thesis, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts, May 1978. Technical report AI-TR-474.
36. C. Strachey Fundamental concepts in programming languages Higher-Order and Symbolic Comput. 13 1/2 2000 1 49
37. P. Wadler The essence of functional programming (invited talk) A.W. Appel Proc. of the Nineteenth Annu. ACM Symp. on Principles of Programming Languages Albuquerque, New Mexico January 1992 ACM Press New York 1 14
38. D.S. Wallach, A.W. Appel, and E.W. Felten SAFKASI: a security mechanism for language-based systems ACM Trans. Software Eng. Methodol. 9 4 2000 341 378