A concrete framework for environment machines

ACM Transactions on Computational Logic

Volumn 9, Issue 1, 2007, Pages

  Biernacka, Magorzata ^a,b   Danvy, Olivier ^a  

^a AARHUS UNIVERSITY   (Denmark)

^b UNIVERSITY OF WROC AW   (Poland)

Author keywords

Abstract machines; Closures; Derivation; Explicit substitutions

Indexed keywords

ABSTRACT MACHINES; CURIEN'S ORIGINAL CALCULUS; EXPLICIT SUBSTITUTIONS; LAMBDA CALCULUS;

DIFFERENTIATION (CALCULUS); NUMERICAL METHODS; OPTIMIZATION; PROBLEM SOLVING; SPECIFICATION LANGUAGES;

AUTOMATA THEORY;

EID: 36448989150     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1297658.1297664     Document Type: Article

References (45)

1. ABADI, M., CARDELLI, L., CURIEN, P.-L., AND LÉVY, J.-J. 1991. Explicit substitutions. J. Funct. Program. 1, 4, 375-416.
2. AGER, M. S., BIERNACKI, D., DANVY, O., AND MIDTGAARD, J. 2003a. From interpreter to compiler and virtual machine: a functional derivation. Tech. rep. BRICS RS-03-14, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark.
3. AGER, M. S., BIERNACKI, D., DANVY, O., AND MIDTGAARD, J. 2003b. A functional correspondence between evaluators and abstract machines. In Proceedings of the 5th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP), D. Miller, Ed. Uppsala, Sweden. ACM Press, 8-19.
4. AGER, M.S., DANVY, O., AND MIDTGAARD, J. 2004. A functional correspondence between call-by-need evaluators and lazy abstract machines. Inform. Proces. Lett. 90, 5, 223-232.
5. AGER, M. S., DANVY, O., AND MIDTGAARD, J. 2005. A functional correspondence between monadic evaluators and abstract machines for languages with computational effects. Theoret. Comput. Sci. 342, 1, 149-172.
6. BARENDREGT, H. 1984. The Lambda Calculus: Its Syntax and Semantics Revised Ed. Studies in Logic and the Foundation of Mathematics, vol. 103. North-Holland.
7. BIERNACKA, M., BIERNACKI, D., AND DANVY, O. 2005. An operational foundation for delimited continuations in the CPS hierarchy. Logic. Methods Comput. Sci. 1, 2:5, 1-39.
8. BIERNACKA, M. AND DANVY, O. 2007. A syntactic correspondence between context-sensitive calculi and abstract machines. Theoret. Comput. Sci. 375, 1-3, 76-108.
9. CHURCH, A. 1941. The Calculi of Lambda-Conversion. Princeton University Press.
10. CREGUT, P. 1990. An abstract machine for lambda-terms normalization. In Proceedings of the ACM Conference on Lisp and Functional Programming, M. Wand, Ed. Nice, France. ACM Press, 333-340.
11. CRÉGUT,P.2007. Strongly reducing variants of the Krivine abstract machine. Higher-Order Symbol. Computat. 20, 3, 209-230.
12. CURIEN, P.-L. 1991. An abstract framework for environment machines. Theoret. Comput. Sci. 82, 389-402.
13. CURIEN, P.-L., HARDIN, T., AND LEVY, J.-J. 1996. Confluence properties of weak and strong calculi of explicit substitutions. J. ACM 43, 2, 362-397.
14. DANVY, O. 1994. Back to direct style. Sci. Comput. Program. 22, 3, 183-195.
15. DANVY, O. 2004a. From reduction-based to reduction-free normalization. In Proceedings of the 4th International Workshop on Reduction Strategies in Rewriting and Programming (WRS), S. Antoy and Y Toyama, Eds. Electronic Notes in Theoretical Computer Science, vol. 124. Elsevier Science, 79-100. Invited talk.
16. DANVY, O. 2004b. On evaluation contexts, continuations, and the rest of the computation. In Proceedings of the 4th ACM SIGPLAN Workshop on Continuations (CW), H. Thielecke, Ed.
17. DANVY, O. 2004C. A rational deconstruction of Landin's SECD machine. In Implementation and Application of Functional Languages, 16th International Workshop, IFL'4, C. Grelck, F. Huch, G. J. Michaelson, and P. Trinder, Eds. Lecture Notes in Computer Science, vol. 3474, Springer-Verlag, 52-71.
18. DANVY, O., Ed. 2007. The Krivine Abstract Machine. Higher-Order Symbol. Computat. 20, 3.
19. DANVY, O. AND MILLIKIN, K. 2008. On the equivalence between small-step and big-step abstract machines: A simple application of lightweight fusion. Inform. Process. Lett. To appear.
20. DANVY, O. AND NIELSEN, L. R. 2001. Defunctionalization at work. In Proceedings of the 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP), H. Stfndergaard, Ed. Firenze, Italy. ACM Press, 162-174.
21. DANVY, O. AND NIELSEN, L. R. 2004. Refocusing in reduction semantics. Tech. rep. BRICS RS-04-26, DAIMI, Department of Computer Science, University of Aarhus, Aarhus. Denmark
22. DE BRULTN, N. G. 1972. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indagationes Mathematicae 34, 5, 381-392.
23. FELLEISEN, M. 1987. The calculi of λ,-v-cs conversion: A syntactic theory of control and state in imperative higher-order programming languages. Ph.D. thesis, Computer Science Department, Indiana University, Bloomington, Indiana.
24. FELLEISEN, M. AND FLATT, M. 1989-2003. Programming languages and lambda calculi. Unpublished lecture notes, 〈http://www.ccs.neu.9du/home/matthias/3810-w02/r9adings.htral〉.
25. FELLEISEN, M. AND FRIEDMAN, D. P. 1986. Control operators, the SECD machine, and the λ.-calculus. In Formal Description of Programming Concepts III, M. Wirsing, Ed. Elsevier Science Publishers B.V. (North-Holland), Amsterdam, 193-217.
26. FRIEDMAN, D. R, GHULOUM, A., SIEK, J. G., AND WINEBARGER, L. 2007. Improving the lazy Krivine machine. Higher-Order Symbol. Computat. 20, 3, 271-293.
27. GANZ, S. E., FRIEDMAN, D. P., AND WAND, M. 1999. Trampolined style. In Proceedings of the 1999 ACM SIGPLAN International Conference on Functional Programming.P.Lee, Ed. Paris, France. ACM Press, 18-27.
28. HANKIN, C. 1994. Lambda Calculi, A Guide for Computer Scientists. Graduate Texts in Computer Science, vol. 1. Oxford University Press.
29. HANNAN, J. AND MILLER, D. 1992. From operational semantics to abstract machines. Mathemat. Struct. Comput. Sci. 2, 4, 415-459.
30. HARDIN, T, MARANGET, L., AND PAGANO, B. 1998. Functional runtime systems within the lambdasigma calculus. J. Funct. Program,. 8, 2, 131-172.
31. KRIVINE, J.-L. 1985. Un interprète du λ-calcul. Brouillon, 〈http://www.pps.jussieu.fr/ ~krivine/〉.
32. KRIVINE, J.-L. 2007. A call-by-name lambda-calculus machine. Higher-Order Symbol. Computat. 20, 3, 199-207.
33. LANDIN, P. J. 1964. The mechanical evaluation of expressions. Comput. J. 6, 4, 308-320.
34. LEROY, X. 1990. The Zinc experiment: an economical implementation of the ML language. Rapport Technique 117, INRIA Rocquencourt, Le Chesnay, France.
35. LESCANNE, P.1994. From λσ to λσ a journey through calculi of explicit substitutions. In Proceedings of the 21st Annual ACM Symposium on Principles of Programming Languages, H.-J. Boehm, Ed. Portland, Oregon. ACM Press, 60-69.
36. MARLOW, S. AND PEYTON JONES, S. L. 2004. Making a fast curry: push/enter vs. eval/apply for higher-order languages. In Proceedings of the 2004 ACM SIGPLAN International Conference on Functional Programming. Snowbird, Utah, K. Fisher, Ed. SIGPLANNotices, vol. 39, no. 9. ACM Press, 4-15.
37. PLOTKIN, G. D. 1975. Call-by-name, call-by-value and the A-calculus. Theoret. Comput. Sci. 1, 125-159.
38. PLOTKIN, G. D. 1981. A structural approach to operational semantics. Tech. rep. FN-19, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark.
39. RANDELL, B. AND RUSSELL, L. J. 1964. ALGOL 60 Implementation. Academic Press.
40. REYNOLDS, J. C. 1972. Definitional interpreters for higher-order programming languages. In Proceedings of 25th ACMNational Conference. Boston, Massachusetts, 717-740.
41. REYNOLDS, J. C. 1998. Definitional interpreters revisited. Higher-Order Symb. Comput. 11, 4, 355-361.
42. ROSE, K. H. 1996a. Explicit substitution-tutorial and survey. BRICS Lecture Series LS-96-3, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark.
43. ROSE, K. H. 1996b. Operational reduction models for functional programming languages. Ph.D. thesis, DIKU, Computer Science Department, University of Copenhagen, Copenhagen, Denmark.
44. SCHOLZ, H. AND HASENJAEGER, G. 1961. Grundzüge der Mathematischen Logik. Springer-Verlag.
45. WAND, M. 2007. On the correctness of the Krivine machine. Higher-Order Symbol. Computat. 20, 3, 231-235.