A tail-recursive machine with stack inspection

ACM Transactions on Programming Languages and Systems

Volumn 26, Issue 6, 2004, Pages 1029-1052

  Clements, John ^a   Felleisen, Matthias ^a  

^a NORTHEASTERN UNIVERSITY   (United States)

Author keywords

Stack inspection; Tail call optimization; Tail recursion

Indexed keywords

OPTIMIZATION POLICY; STACK COMPENSATION; TAIL CALL OPTIMIZATION; TAIL RECURSIVE;

COMPUTER PROGRAMMING LANGUAGES; OPTIMIZATION; STORAGE ALLOCATION (COMPUTER);

SECURITY OF DATA;

EID: 24644501711     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/1034774.1034778     Document Type: Article

References (21)

1. BENTON, N., KENNEDY, A., AND RUSSELL, G. 1998. Compiling standard ML to Java bytecodes. In Proceedings of the ACM SIGPLAN International Conference on Functional Programming. 129-140.
2. BOX, D. 2002. Essential .NET, Volume I: The Common Language Runtime. Addison-Wesley, Reading, MA.
3. CLEMENTS, J., FLATT, M., AND FELLEISEN, M. 2001. Modeling an algebraic stepper. In Proceedings of the European Symposium on Programming. 320-334.
4. CLINGER, W. D. 1998. Proper tail recursion and space efficiency. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation. 174-185.
5. ERLINGSSON, U. AND SCHNEIDER, F. B. 2000. IRM enforcement of Java stack inspection. In Proceedings of the IEEE Symposium on Security and Privacy. 246-255.
6. FELLEISEN, M. AND FLATT, M. 1989-2002. Programming languages and their calculi. Unpublished manuscript. Available online at 〈http://www.ccs.neu. edu/home/matthias/3810-w02/mono.ps.gz〉.
7. FELLEISEN, M. AND FRIEDMAN, D. P. 1986. Control operators, the SECD-machine, and the X-calculus. In Formal Description of Programming Concepts III, M. Wirsing, Ed. Elsevier Science Publishers B.V., Amsterdam, The Netherlands, 193-217.
8. FLATT, M. 1995-2002, PLT MzScheme: Language manual. Available online at 〈http://www.plt-scheme.org〉.
9. FOURNET, C. AND GORDON, A. D. 2002. Stack inspection: Theory and variants. In Proceedings of the Symposium on Principles of Programming Languages. 307-318.
10. GAMMA, E., HELM, R., JOHNSON, R., AND VLISSIDES, J. 1995. Design Patterns. Addison-Wesley, Reading, MA.
11. GONG, L. 1999. Inside Java 2 Platform Security. Sun Microsystems, Santa Clara, CA.
12. KARJOTH, G. 2000. An operational semantics of Java 2 access control. In Proceedings of the Computer Security Foundations Workshop. 224-232.
13. 5 report on the algorithmic language scheme. ACM SIGPLAN Not. 33, 9, 26-76.
14. MICROSOFT. 2002. Common language runtime SDK documentation. Available online at http:// www.microsoft.com. Part of .NET SDK documentation.
15. PLOTKIN, G. D. 1975. Call-by-name, call-by-value and the λ-calculus. Theoret. Comput. Sci. 125-159.
16. POTTIER, F., SKALKA, C., AND SMITH, S. 2001. A systematic approach to static access control. In Proceedings of the European Symposium on Programming. 30-45.
17. SCHINZ, M. AND ODERSKY, M. 2001. Tail call elimination on the Java virtual machine. In Proceedings of the SIGPLAN BABEL Workshop on Multi-Language Infrastructure and Interoperability. 155-168.
18. SKALKA, C. AND SMITH, S. 2000. Static enforcement of security with types. ACM SIGPLAN Not. 35, 9, 34-15.
19. STEELE JR., G. L. 1977. Debunking the 'expensive procedure call' myth. In Proceedings of the 1977 Annual ACM Conference. 153-162.
20. WALLACH, D., BALFANZ, D., DEAN, D., AND FELTEN, E. 1997. Extensible security architectures for Java. In Proceedings of the 16th Symposium on Operating Systems Principles. 116-128.
21. WALLACH, D., FELTEN, E., AND APPEL, A. 2000. The security architecture formerly known as stack inspection: A security mechanism for language-based systems. ACM Trans. Softw. Eng. Methodol. 9, 4 (Oct.), 341-378.