{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:12:04Z","timestamp":1725664324559},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540603603"},{"type":"electronic","value":"9783540450504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60360-3_39","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:20:01Z","timestamp":1330262401000},"page":"172-188","source":"Crossref","is-referenced-by-count":3,"title":["A type-based analysis for stack allocation in functional languages"],"prefix":"10.1007","author":[{"given":"John","family":"Hannan","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"4","key":"12_CR1","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1017\/S0956796800000186","volume":"1","author":"M. Abadi","year":"1991","unstructured":"M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. L\u00e9vy. Explicit substitutions. Journal of Functional Programming, 1(4):375\u2013416, October 1991.","journal-title":"Journal of Functional Programming"},{"doi-asserted-by":"crossref","unstructured":"Torben Amtoft. Minimal thunkification. In Patrick Courot, Moreno Falaschi, Gilberto Fil\u00e8, and Antoine Rauzy, editors, Third International Workshop on Static Analysis, volume 724 of Lecture Notes in Computer Science, pages 218\u2013229. Springer-Verlag, 1993.","key":"12_CR2","DOI":"10.1007\/3-540-57264-3_43"},{"doi-asserted-by":"crossref","unstructured":"Anindya Banerjee and David A. Schmidt. Stackability in the simply-typed call-by-value lambda calculus. In Baudoin Le Charlier, editor, First International Static Analysis Symposium, volume 864 of Lecture Notes in Computer Science, pages 131\u2013146. Springer-Verlag, 1994.","key":"12_CR3","DOI":"10.1007\/3-540-58485-4_37"},{"unstructured":"Luis Damas. Type Assignment in Programming Language. PhD thesis, University of Edinburgh, 1985. Available as CST-33-85.","key":"12_CR4"},{"doi-asserted-by":"crossref","unstructured":"Benjamin Goldberg and Young Gil Park. Higher order esape analysis: Optimizing stack allocation in functional program implementations. In Neil Jones, editor, Proceedings of the Third European Symposium on Programming, volume 432 of Lecture Notes in Computer Science, pages 152\u2013160. Springer-Verlag, 1990.","key":"12_CR5","DOI":"10.1007\/3-540-52592-0_61"},{"unstructured":"John Hannan. Type systems for closure conversions. In Hanne Riis Nielson and Kirsten Lackner Solberg, editors, Participants' Proceedings of the Workshop on Types for Program Analysis, pages 48\u201362. Aarhus University, DAIMI PB-493, May 1995.","key":"12_CR6"},{"issue":"4","key":"12_CR7","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1017\/S0960129500001559","volume":"2","author":"J. Hannan","year":"1992","unstructured":"John Hannan and Dale Miller. From operational semantics to abstract machines. Mathematical Structures in Computer Science, 2(4):415\u2013459, 1992. Appears in a special issue devoted to the 1990 ACM Conference on Lisp and Functional Programming.","journal-title":"Mathematical Structures in Computer Science"},{"doi-asserted-by":"crossref","unstructured":"John Hannan and Frank Pfenning. Compiler verification in LF. In Andre Scedrov, editor, Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pages 407\u2013418. IEEE Computer Society Press, 1992.","key":"12_CR8","DOI":"10.1109\/LICS.1992.185552"},{"doi-asserted-by":"crossref","unstructured":"Fritz Henglein. Iterative fixed point computation for type-based stritness analysis. In Baudouin Le Charlier, editor, First International Static Analysis Symposium, volume 864 of Lecture Notes in Computer Science, pages 395\u2013407. Springer-Verlag, 1994.","key":"12_CR9","DOI":"10.1007\/3-540-58485-4_54"},{"key":"12_CR10","volume-title":"Rapport nr 92\/6","author":"P. Sestoft","year":"1991","unstructured":"Peter Sestoft. Analysis and Efficient Implementation of Functional Programs. Rapport nr 92\/6, DIKU, Copenhagen, October 1991."},{"unstructured":"Mads Tofte. Operational Semantics and Polymorphic Type Inference. PhD thesis, University of Edinburgh, 1987.","key":"12_CR11"},{"doi-asserted-by":"crossref","unstructured":"Mads Tofte and Jean-Pierre Talpin. Implementation of the typed call-by-value \u03bb-calculus using a stack of regions. In Conf. Rec. 21st ACM Symposium on Principles of Programming Languages, pages 188\u2013201,1994.","key":"12_CR12","DOI":"10.1145\/174675.177855"},{"doi-asserted-by":"crossref","unstructured":"Mitchell Wand and Paul Steckler. Selective and lightweight closure conversion. In Conf. Rec. 21st ACM Symposium on Principles of Programming Languages, 1994.","key":"12_CR13","DOI":"10.1145\/174675.178044"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60360-3_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:58:24Z","timestamp":1605628704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60360-3_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603603","9783540450504"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-60360-3_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}