State-transition machines for lambda-calculus expressions

Higher-Order and Symbolic Computation

Volumn 20, Issue 3, 2007, Pages 319-332

  Schmidt, David A ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Continuations; Defunctionalization; Denotational semantics; Lambda calculus; SECD machine; State transition machine; Weak normal form

Indexed keywords

AUTOMATA THEORY; PROGRAM COMPILERS; SEMANTICS; SET THEORY;

DENOTATIONAL SEMANTICS; LAMBDA CALCULUS; STATE TRANSITION MACHINE;

LEARNING SYSTEMS;

EID: 36448956881     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10990-007-9012-2     Document Type: Article

References (14)

1. Church, A.: The Calculi of Lambda-Conversion. Annals of Mathematical Studies, vol. 6. Princeton Univ. Press, Princeton (1951)
2. Curry, H., Feys, R.: Combinatory Logic, vol. 1. North-Holland, Amsterdam (1958)
3. Ershov, A.: On the essence of compilation. In: Neuhold, E. (ed.) Formal Description of Programming Concepts, pp. 391-420. North-Holland, Amsterdam (1978)
4. 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)
5. Landin, P.: The mechanical evaluation of expressions. Comput. J. 6(4), 308-320 (1964)
6. Plotkin, G.: Call-by-name, call-by-value and the λ-calculus. Theor. Comput. Sci. 1, 125-159 (1975)
7. Reynolds, J.: Definitional interpreters for higher-order programming languages. In: Proc. 25th ACM National Conference, Boston, pp. 717-740 (1972)
8. 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)
9. Schmidt, D.: Compiler generation from lambda-calculus definitions of programming languages. Ph.D. Thesis, Kansas State University, Manhattan, KS (1981)
10. Scott, D.: Data types as lattices. SIAM J. Comput. 5, 522-587 (1976)
11. Stoy, J.: Denotational Semantics. MIT Press, Cambridge (1997)
12. Strachey, C., Wadsworth, C.: Continuations-a mathematical semantics for handling full jumps. Technical Report PRG-11, Programming Research Group, Oxford University (1974)
13. Wadsworth, C.: The relation between computational and denotational properties for Scott's models of the lambda-calculus. SIAM J. Comput. 5, 488-521 (1976)
14. Watt, D., Madsen, O.: Extended attribute grammars. Technical Report 10, University of Glasgow (1977). Revised version: On defining semantics by means of extended attribute grammars. In: Jones, N.D. (ed.) Semantics-Directed Compiler Generation. Lecture Notes in Computer Science, vol. 94. Springer (1980)