{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:07:46Z","timestamp":1725494866401},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403258"},{"type":"electronic","value":"9783540448983"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44898-5_9","type":"book-chapter","created":{"date-parts":[[2007,11,10]],"date-time":"2007-11-10T22:21:25Z","timestamp":1194733285000},"page":"153-170","source":"Crossref","is-referenced-by-count":4,"title":["Selective Tail Call Elimination"],"prefix":"10.1007","author":[{"given":"Yasuhiko","family":"Minamide","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"issue":"9","key":"9_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/214448.214454","volume":"30","author":"H. Baker","year":"1995","unstructured":"H. Baker. Cons should not cons its arguments, part II: Cheney on the M.T.A. SIGPLAN Notices, 30(9):17\u201320, 1995.","journal-title":"SIGPLAN Notices"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"N. Benton, A. Kennedy, and G. Russell. Compiling Standard ML to Java bytecodes. In Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming (ICFP\u2019 98), pages 129\u2013140, 1998.","DOI":"10.1145\/289423.289435"},{"key":"9_CR3","unstructured":"P. Bothner. Kawa-Compiling dynamic languages to the Java VM. In Proceedings of the USENIX 1998 Technical Conference, 1998."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"M. M. T. Chakravarty and G. Keller. More types for nested data parallel programming. In Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming, pages 94\u2013105, 1999.","DOI":"10.1145\/357766.351249"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"W. D. Clinger. Proper tail recursion and space efficiency. In Proceedings of the ACM SIGPLAN\u201998 Conference on Programming Language Design and Implementation, pages 174\u2013185. ACM Press, 1998.","DOI":"10.1145\/277650.277719"},{"issue":"1","key":"9_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/130616.130620","volume":"1","author":"V. Dornic","year":"1992","unstructured":"V. Dornic, P. Jouvelot, and D. K. Gifford. Polymorphic time systems for estimating program complexity. ACM Letters on Programming Languages and Systems (LOPLAS), 1(1):33\u201345, 1992.","journal-title":"ACM Letters on Programming Languages and Systems (LOPLAS)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"S. D. Ganz, D. P. Friedman, and M. Wand. Trampolined style. In Proceedings of the 4th ACM SIGPLAN International Conference on Functional Programming (ICFP\u2019 99), pages 18\u201322, 1999.","DOI":"10.1145\/317636.317779"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"D. K. Gifford and J. M. Lucassen. Integrating functional and imperative programming. In Proceedings of the ACM Conference on Lisp and Functional Programming, pages 28\u201338, 1986.","DOI":"10.1145\/319838.319848"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"J. Hughes, L. Pareto, and A. Sabry. Proving the correctness of reactive systems. In Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 410\u2013423, 1996.","DOI":"10.1145\/237721.240882"},{"key":"9_CR10","unstructured":"T. Lindholm and F. Yellin. The Java Virtual Machine Specification. Addison Wesley, 1999."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"J. M. Lucassen and D. K. Gifford. Polymorphic effect systems. In Proceedings of the Fifteenth ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 47\u201357, 1988.","DOI":"10.1145\/73560.73564"},{"key":"9_CR12","unstructured":"Y. Minamide. A new criterion for safe program transformations. In Proceedings of the Forth International Workshop on Higher Order Operational Techniques in Semantics (HOOTS), volume 41(3) of ENTCS, Montreal, 2000."},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Y. Minamide. Selective tail call elimination. Technical Report ISE-TR-03-192, Institute of Information Sciences and Electronics, University of Tsukuba, 2003.","DOI":"10.1007\/3-540-44898-5_9"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Y. Minamide and J. Garrigue. On the runtime complexity of type-directed unboxing. In Proceedings of the Third ACM SIGPLAN International conference on Functional Programming, pages 1\u201312, 1998.","DOI":"10.1145\/289423.289424"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"B. Reistad and D. K. Gifford. Static dependent costs for estimating execution time. In Proceedings of the 1994 ACM Conference on LISP and Functional Programming, pages 65\u201378, 1994.","DOI":"10.1145\/182409.182439"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"M. Schinz and M. Odersky. Tail call elimination on the Java virtual machine. In Proceedings of the First International Workshop on Multi-Language Infrastructure and Interoperability (BABEL), volume 59(1) of ENTCS, 2001.","DOI":"10.1016\/S1571-0661(05)80459-1"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"B. Serpette and M. Serrano. Compiling Scheme to JVM bytecode: a performance study. In Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming, pages 259\u2013270, 2002.","DOI":"10.1145\/581478.581503"},{"issue":"2","key":"9_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/151333.151343","volume":"1","author":"D. Tarditi","year":"1992","unstructured":"D. Tarditi, A. Acharya, and P. Lee. No assembly required: Compiling standard ML to C. ACM Letters on Programming Languages and Systems (LOPLAS), 1(2):161\u2013177, 1992.","journal-title":"ACM Letters on Programming Languages and Systems (LOPLAS)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44898-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T05:21:04Z","timestamp":1556947264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44898-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403258","9783540448983"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44898-5_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}