Tail-recursive SECD machine

Journal of Automated Reasoning

Volumn 23, Issue 1, 1999, Pages 43-62

  Ramsdell, John D ^a  

^a MITRE CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SYSTEMS PROGRAMMING; THEOREM PROVING;

BOYER-MOORE THEOREM PROVER; TAIL-RECURSIVE ABSTRACT MACHINE;

ARTIFICIAL INTELLIGENCE;

EID: 0032629599     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1006151910336     Document Type: Article

References (19)

1. Barendregt, H. P.: The Lambda Calculus, Its Syntax and Semantics, North-Holland, Amsterdam, 1984, revised edition.
2. Boyer, R. S. and Moore, J S.: A Computational Logic Handbook, Academic Press, 1988.
3. Clinger, W. D.: The scheme 311 compiler: An exercise in denotational semantics, in ACM Symposium on Lisp and Functional Programming, New York, 1984, pp. 356-364.
4. Clinger, W. D.: Proper tail recursion and space efficiency, ACM SIGPLAN Notices 33(5) (1998), pp. 174-185. Proc. SIGPLAN '98 Conference on Programming Language Design and Implementation.
5. Clinger, W. D.: Proper tail recursion and space efficiency, ACM SIGPLAN Notices 33(5) (1998), pp. 174-185. Proc. SIGPLAN '98 Conference on Programming Language Design and Implementation.
6. Danvy, O. and Filinski, A.: Representing control, a study of the CPS transformation, Math. Struct. Comput. Sci. 2(4) (1992), pp. 361-391.
7. Felleisen, M. and Friedman, D.: Control operators, the SECD-machine, and the lambda calculus, in M. Wirsing (ed.), Formal Description of Programming Concepts III, Elsevier, Amsterdam, 1987, pp. 193-217.
8. Flanagan, C., Sabry, A., Duba, B. F. and Felleisen, M.: The essence of compiling with continuations, ACM SIGPLAN Notices 28(6) (1993), pp. 237-247. Proc. SIGPLAN '93 Conference on Programming Language Design and Implementation.
9. Flanagan, C., Sabry, A., Duba, B. F. and Felleisen, M.: The essence of compiling with continuations, ACM SIGPLAN Notices 28(6) (1993), pp. 237-247. Proc. SIGPLAN '93 Conference on Programming Language Design and Implementation.
10. Graham, B. T.: The SECD Machine: A Verification Case Study, SECS178, Kluwer Academic Publishers, Dordrecht, 1992.
11. Hannan, J.: Making abstract machines less abstract, in J. Hughes (ed.), Lecture Notes in Comput. Sci. 524, 1991, pp. 618-635. Proc. of the 5th ACM Conference on Function Programming Languages and Computer Architecture.
12. Hannan, J.: Making abstract machines less abstract, in J. Hughes (ed.), Lecture Notes in Comput. Sci. 524, 1991, pp. 618-635. Proc. of the 5th ACM Conference on Function Programming Languages and Computer Architecture.
13. IEEE Std 1178-1990: IEEE Standard for the Scheme Programming Language, Institute of Electrical and Electronic Engineers, New York, 1991.
14. Kelsey, R., Clinger, W. and Rees, J. (eds.): Revised report on the algorithmic language scheme, Higher-Order and Symbolic Computation 11(1) (1998), pp. 7-105.
15. Plotkin, G. D.: Call-by-name, Call-by-value and the λ-calculus, Theoret. Comput. Sci. 1 (1975), 125-159.
16. Ramsdell, J. D.: SECD Events, NQTHM event file, 1996. ftp://ftp.cs.utexas.edu/pub/ boyer/nqthm/trsecd/secd.events.
17. Ramsdell, J. D.: TR-SECD Events, NQTHM event file, 1996. ftp://ftp.cs.utexas.edu/pub/ boyer/nqthm/trsecd/trsecd.events.
18. Shankar, N.: Metamathematics, Machines, and Goedel's Proof, Cambridge Univ. Press, Cambridge, 1994, revised edition.
19. Wand, M.: Correctness of procedure representations in higher-order assembly language, in S. Brookes, M. Main, A. Melton, M. Mislove, and D. Schmidt (eds.), Lecture Notes in Comput. Sci. 529, 1991, pp. 294-311. Mathematical Foundations of Programming Semantics.