On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion

Information Processing Letters

Volumn 106, Issue 3, 2008, Pages 100-109

  Danvy, Olivier ^a   Millikin, Kevin ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Abstract machines; Program derivation; Programming calculi; Programming languages; Refocusing; Warm fusion

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; FUNCTION EVALUATION; INFORMATION FUSION; SEMANTICS; SPECIFICATIONS;

ABSTRACT MACHINES; PROGRAM DERIVATION; PROGRAMMING CALCULI;

ABSTRACTING;

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

References (22)

1. Ager M.S., Biernacki D., Danvy O., and Midtgaard J. A functional correspondence between evaluators and abstract machines. In: Miller D. (Ed). Proceedings of the Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP'03) (2003), ACM Press, Uppsala, Sweden
2. Aho A.V., Sethi R., and Ullman J.D. Compilers: Principles, Techniques and Tools. World Student Series (1986), Addison-Wesley, Reading, MA
3. M. Biernacka, D. Biernacki, Formalizing constructions of abstract machines for functional languages in Coq., in: J. Giesl (Ed.), Preliminary Proceedings of the Seventh International Workshop on Reduction Strategies in Rewriting and Programming (WRS'07), Paris, France, 2007
4. M. Biernacka, O. Danvy, A concrete framework for environment machines, ACM Transactions on Computational Logic, in press. Available as the research report BRICS RS-06-3
5. Biernacka M., and Danvy O. A syntactic correspondence between context-sensitive calculi and abstract machines. Theoretical Computer Science 375 1-3 (2007) 76-108 Extended version available as the research report BRICS RS-06-18
6. Clinger W., Friedman D.P., and Wand M. A scheme for a higher-level semantic algebra. In: Reynolds J., and Nivat M. (Eds). Algebraic Methods in Semantics (1985), Cambridge University Press
7. Curien P.-L. An abstract framework for environment machines. Theoretical Computer Science 82 (1991) 389-402
8. Danvy O., and Nielsen L.R. Refocusing in reduction semantics, Research Report BRICS RS-04-26, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark. A preliminary version appeared in the informal proceedings of the Second International Workshop on Rule-Based Programming (RULE 2001). Electronic Notes in Theoretical Computer Science 59 4 (Nov. 2004)
9. M. Felleisen, The calculi of λ-v-cs conversion: A syntactic theory of control and state in imperative higher-order programming languages, PhD thesis, Computer Science Department, Indiana University, Bloomington, Indiana, Aug. 1987
10. 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
11. Felleisen M., and Friedman D.P. Control operators, the SECD machine, and the λ-calculus. In: Wirsing M. (Ed). Formal Description of Programming Concepts III (1986), Elsevier Science Publishers B.V. (North-Holland), Amsterdam 193-217
12. Ganz S.E., Friedman D.P., and Wand M. Trampolined style. In: Lee P. (Ed). Proceedings of the 1999 ACM SIGPLAN International Conference on Functional Programming. SIGPLAN Notices 34 9 (1999)
13. J.-L. Krivine, A call-by-name lambda-calculus machine, Higher-Order and Symbolic Computation 20 (3), in press. Available online at http://www.pps.jussieu.fr/~krivine/
14. Landin P.J. The mechanical evaluation of expressions. The Computer Journal 6 4 (1964) 308-320
15. Launchbury J., and Sheard T. Warm fusion: Deriving build-cata's from recursive definitions. In: Peyton Jones S. (Ed). Proceedings of the Seventh ACM Conference on Functional Programming and Computer Architecture (1995), ACM Press, La Jolla, CA
16. Marlow S., and Peyton Jones S.L. Making a fast curry: push/enter vs. eval/apply for higher-order languages. In: Fisher K. (Ed). Proceedings of the 2004 ACM SIGPLAN International Conference on Functional Programming (ICFP'04). SIGPLAN Notices 39 9 (2004)
17. Martin J.C. Introduction to Languages and the Theory of Computation. Programming Language Series. second ed. (1997), McGraw-Hill International Editions
18. Ohori A., and Sasano I. Lightweight fusion by fixed point promotion. In: Felleisen M. (Ed). Proceedings of the Thirty-Fourth Annual ACM Symposium on Principles of Programming Languages. SIGPLAN Notices 42 1 (2007)
19. Plotkin G.D. Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science 1 1 (1975) 125-159
20. Reynolds J.C. Definitional interpreters for higher-order programming languages. Proceedings of 25th ACM National Conference, Boston, Massachusetts, 1972, reprinted in. Higher-Order and Symbolic Computation 11 4 (1998) 363-397 with a foreword [21]
21. Reynolds J.C. Definitional interpreters revisited. Higher-Order and Symbolic Computation 11 4 (1998) 355-361
22. Winskel G. The Formal Semantics of Programming Languages. Foundation of Computing Series (1993), The MIT Press