{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,25]],"date-time":"2026-10-25T23:15:21Z","timestamp":1792970121392,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540008866","type":"print"},{"value":"9783540365754","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36575-3_3","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T21:52:15Z","timestamp":1193521935000},"page":"22-37","source":"Crossref","is-referenced-by-count":8,"title":["A Tail-Recursive Semantics for Stack Inspections"],"prefix":"10.1007","author":[{"given":"John","family":"Clements","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthias","family":"Felleisen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Nick Benton, Andrew Kennedy, and George Russell. Compiling standard ML to Java bytecodes. In ACM SIGPLAN International Conference on Functional Programming, pages 129\u2013140, 1998.","DOI":"10.1145\/289423.289435"},{"key":"3_CR2","unstructured":"Don Box. Essential.NET, Volume I: The Common Language Runtime. Addison-Wesley, To Appear."},{"key":"3_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/3-540-45309-1_21","volume-title":"Modeling an algebraic stepper","author":"J. Clements","year":"2001","unstructured":"John Clements, Matthew Flatt, and Matthias Felleisen. Modeling an algebraic stepper. Lecture Notes in Computer Science, 2028:320\u2013334, 2001."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"William D. Clinger. Proper tail recursion and space efficiency. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 174\u2013185, 1998.","DOI":"10.1145\/277650.277719"},{"key":"3_CR5","unstructured":"Matthias Felleisen and Matthew Flatt. Programming languages and their calculi. Unpublished Manuscript. Online at http:\/\/www.ccs.neu.edu\/home\/matthias\/3810-w02\/mono.ps.gz >, 1989\u20132002."},{"key":"3_CR6","unstructured":"Matthew Flatt. PLT MzScheme: Language manual. Online at http:\/\/www.plt-scheme.org >, 1995-2002."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Cedric Fournet and Andrew D. Gordon. Stack inspection: theory and variants. In Symposium on Principles of Programming Languages, pages 307\u2013318, 2002.","DOI":"10.1145\/503272.503301"},{"key":"3_CR8","unstructured":"Erich Gamma, Richard Helm, Ralph Johnson, and John Vlissides. Design Patterns. Addison-Wesley, 1995."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Guy Lewis Steele Jr. Debunking the \u201cexpensive procedure call\u201d myth. In ACM Conference, pages 153\u2013162, 1977.","DOI":"10.1145\/800179.810196"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"G\u00fcnter Karjoth. An operational semantics of Java 2 access control. In The Computer Security Foundations Workshop, pages 224\u2013232, 2000.","DOI":"10.1109\/CSFW.2000.856939"},{"issue":"9","key":"3_CR11","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/290229.290234","volume":"33","author":"R. Kelsey","year":"1998","unstructured":"Richard Kelsey, William D. Clinger, and Jonathan Rees. Revised5 report on the algorithmic language scheme. SIGPLAN Notices, 33(9):26\u201376, 1998.","journal-title":"SIGPLAN Notices"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Gordon D. Plotkin. Call-by-name, call-by-value and the \u03bb-calculus. Theoretical Computer Science, pages 125\u2013159, 1975.","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"3_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/3-540-45309-1_3","volume-title":"A systematic approach to static access control","author":"F. Pottier","year":"2001","unstructured":"F. Pottier, Christian Skalka, and Scott Smith. A systematic approach to static access control. Lecture Notes in Computer Science, 2028:30\u201345, 2001."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Michel Schinz and Martin Odersky. Tail call elimination on the Java virtual machine. In SIGPLAN BABEL Workshop on Multi-Language Infrastructure and Interoperability, pages 155\u2013168, 2001.","DOI":"10.1016\/S1571-0661(05)80459-1"},{"issue":"9","key":"3_CR15","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/357766.351244","volume":"35","author":"C. Skalka","year":"2000","unstructured":"Christian Skalka and Scott Smith. Static enforcement of security with types. ACM SIGPLAN Notices, 35(9):34\u201345, 2000.","journal-title":"ACM SIGPLAN Notices"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Dan Wallach, Dirk Balfanz, Drew Dean, and Ed Felten. Extensible security architectures for Java. In The 16th Symposium on Operating Systems Principles, pages 116\u2013128, october 1997.","DOI":"10.1145\/268998.266668"},{"issue":"4","key":"3_CR17","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/363516.363520","volume":"9","author":"D. Wallach","year":"2000","unstructured":"Dan Wallach, Edward Felten, and Andrew Appel. The security architecture formerly known as stack inspection: A security mechanism for language-based systems. ACM Transactions on Software Engineering and Methodology, 9(4):341\u2013378, October 2000.","journal-title":"ACM Transactions on Software Engineering and Methodology"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36575-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:40:41Z","timestamp":1737502841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36575-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008866","9783540365754"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-36575-3_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}