State-transition machines, revisited

Higher-Order and Symbolic Computation

Volumn 20, Issue 3, 2007, Pages 333-335

  Schmidt, David A ^a  

^a Kansas State University   (United States)

Author keywords

Continuation passing style; Defunctionalization; Denotational semantics; Krivine machine; Lambda calculus

Indexed keywords

MACHINE DESIGN; MECHANIZATION;

DEFUNCTIONALIZATION; DENOTATIONAL SEMANTICS; KRIVINE MACHINE; LAMBDA CALCULUS;

SEMANTICS;

EID: 36448961630     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10990-007-9017-x     Document Type: Article

References (18)

1. Ager, M., Biernacki, D., Danvy, O., Midtgaard, J.: A functional correspondence between evaluators and abstract machines. In: Proc. 5th ACM-SIGPLAN Int. Conf. Principles and Practice of Declarative Programming, pp. 8-19 (2003)
2. Cousineau, G., Curien, P.-L.: The categorical abstract machine. Sci. Comput. Program. 8, 173-202 (1987)
3. Crégut, P.: An abstract machine for lambda-terms normalization. In: Proc. ACM Symp. Lisp and Functional Programming, pp. 333-340 (1990)
4. Curien, P.-L.: An abstract framework for environment machines. Theor. Comput. Sci. 82, 389-402 (1991)
5. Danvy, O.: A rational deconstruction of Landin's SECD machine. In: 16th Int. Workshop, Implementation and Application of Functional Languages, pp. 52-71 (2004). Extended version available as the technical report BRICS RS-03-33
6. Felleisen, M., Friedman, D.: Control operators, the SECD-machine, and the λ-calculus. In: Wirsing, M. (ed.) Formal Description of Programming Concepts III, pp. 193-217. North-Holland, Amsterdam (1986)
7. Hannan, J., Miller, D.: From operational semantics to abstract machines. Math. Struct. Comput. Sci. 2, 415-459 (1992)
8. Jones, N. (ed.): Semantics-Directed Compiler Generation. Lecture Notes in Computer Science, vol. 94. Springer, New York (1980)
9. Jones, N.: Flow analysis of lambda expressions. In: Int. Conf. on Automata, Languages, and Programming. Lecture Notes in Computer Science, vol. 115, pp. 114-128. Springer, New York (1981)
10. Jones, N., Schmidt, D.: Compiler generation from denotational semantics. In: Jones, N. (ed.) Semantics-Directed Compiler Generation. Lecture Notes in Computer Science, vol. 94, pp. 70-93. Springer, New York (1980)
11. Krivine, J.-L.: Un interprète du λ-calcul. Brouillon (1985). Available online at http://www.pps.jussieu.fr/~krivine/
12. Peyton Jones, S.: Implementing lazy functional languages on stock hardware: the spineless, tagless G-machine. J. Funct. Program. 2, 127-202 (1992)
13. Reynolds, J.: On the relation between direct and continuation semantics. In: Proc. 2d Colloquium on Automata, Languages, and Programming. Lecture Notes in Computer Science, pp. 141-156. Springer, New York (1974)
14. Reynolds, J.C.: Definitional interpreters for higher-order programming languages. Higher-Order Symb. Comput. 11(4), 363-397 (1998)
15. Schmidt, D.: State transition machines for lambda-calculus expressions. In: Jones, N. (ed.) Semantics-Directed Compiler Generation. Lecture Notes in Computer Science, vol. 94, pp. 415-440. Springer, New York (1980)
16. Schmidt, D.: Denotational Semantics. Allyn and Bacon, Boston (1986)
17. Stoy, J.: Denotational Semantics. MIT Press, Cambridge (1977)
18. Wadsworth, C.: The relation between computational and denotational properties for Scott's models of the lambda-calculus. SIAM J. Comp. 5, 488-521 (1976)