{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:17:27Z","timestamp":1763468247611,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662466681"},{"type":"electronic","value":"9783662466698"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46669-8_32","type":"book-chapter","created":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T14:37:37Z","timestamp":1427899057000},"page":"787-811","source":"Crossref","is-referenced-by-count":11,"title":["Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages"],"prefix":"10.1007","author":[{"given":"Pedro","family":"Vasconcelos","sequence":"first","affiliation":[]},{"given":"Steffen","family":"Jost","sequence":"additional","affiliation":[]},{"given":"M\u00e1rio","family":"Florido","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Hammond","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","unstructured":"Barwise, J., Moss, L.: Vicious Circles. CSLI Publications (1996)"},{"key":"32_CR2","volume-title":"Introduction to Functional Programming","author":"R. Bird","year":"1988","unstructured":"Bird, R., Wadler, P.: Introduction to Functional Programming. Prentice-Hall, Englewood Cliffs (1988)"},{"key":"32_CR3","unstructured":"Coutts, D.: Stream Fusion: Practical shortcut fusion for coinductive sequence types. PhD thesis, Worcester College, University of Oxford (2010)"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Simoes, H., Vasconcelos, P., Jost, S., Hammond, K., Florido, M.: Automatic amortised analysis of dynamic memory allocation for lazy functional programs. In: Proc. of ACM Intl. Conf. Func. Programming (ICFP 2012), pp. 165\u2013176. ACM (2012)","DOI":"10.1145\/2398856.2364575"},{"issue":"3","key":"32_CR5","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1017\/S0956796897002712","volume":"7","author":"P. Sestoft","year":"1997","unstructured":"Sestoft, P.: Deriving a Lazy Abstract Machine. J. Functional Programming\u00a07(3), 231\u2013264 (1997)","journal-title":"J. Functional Programming"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Launchbury, J.: A Natural Semantics for Lazy Evaluation. In: Proc. POPL 1993: Symp. on Princ. of Prog. Langs., pp. 144\u2013154 (1993)","DOI":"10.1145\/158511.158618"},{"key":"32_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-642-05089-3_23","volume-title":"FM 2009: Formal Methods","author":"S. Jost","year":"2009","unstructured":"Jost, S., Loidl, H.W., Hammond, K., Scaife, N., Hofmann, M.: \u201cCarbon Credits\u201d for Resource-Bounded Computations Using Amortised Analysis. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol.\u00a05850, pp. 354\u2013369. Springer, Heidelberg (2009)"},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/3-540-46028-4_6","volume-title":"Implementation of Functional Languages","author":"A. Encina de la","year":"2002","unstructured":"de la Encina, A., Pe\u00f1a, R.: Proving the Correctness of the STG Machine. In: Arts, T., Mohnen, M. (eds.) IFL 2002. LNCS, vol.\u00a02312, pp. 88\u2013104. Springer, Heidelberg (2002)"},{"issue":"2","key":"32_CR9","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1017\/S0956796800000319","volume":"2","author":"S.L. Peyton Jones","year":"1992","unstructured":"Peyton Jones, S.L.: Implementing Lazy Functional Languages on Stock Hardware \u2013 the Spineless Tagless G-machine. J. Functional Programming\u00a02(2), 127\u2013202 (1992)","journal-title":"J. Functional Programming"},{"key":"32_CR10","unstructured":"S\u00e1nchez-Gil, L., Hidalgo-Herrero, M., Ortega-Mall\u00e9n, Y.: The role of indirections in lazy natural semantics. Technical Report TR-13-13, Departamento de Sistemas Informticos y Computacin, Universidad Complutense de Madrid (2013)"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"de la Encina, A., Pe\u00f1a-Mar\u00ed, R.: Formally Deriving an STG Machine. In: Proc. 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, Uppsala, Sweden, August 27-29, pp. 102\u2013112. ACM (2003)","DOI":"10.1145\/888251.888262"},{"issue":"1","key":"32_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1017\/S0956796808006746","volume":"19","author":"A. Encina de la","year":"2009","unstructured":"de la Encina, A., Pe\u00f1a-Mar\u00ed, R.: From Natural Semantics to C: a Formal Derivation of two STG Machines. J. Funct. Program.\u00a019(1), 47\u201394 (2009)","journal-title":"J. Funct. Program."},{"key":"32_CR13","unstructured":"Sands, D.: Calculi for Time Analysis of Functional Programs. PhD thesis, Imperial College, University of London (September 1990)"},{"key":"32_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/3-540-52592-0_74","volume-title":"ESOP \u201990","author":"D. Sands","year":"1990","unstructured":"Sands, D.: Complexity Analysis for a Lazy Higher-Order Language. In: Jones, N.D. (ed.) ESOP 1990. LNCS, vol.\u00a0432, pp. 361\u2013376. Springer, Heidelberg (1990)"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Strictness Analysis aids Time Analysis. In: Proc. POPL 1988: ACM Symp. on Princ. of Prog. Langs, pp. 119\u2013132 (1988)","DOI":"10.1145\/73560.73571"},{"key":"32_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/3-540-18317-5_21","volume-title":"Functional Programming Languages and Computer Architecture","author":"P. Wadler","year":"1987","unstructured":"Wadler, P., Hughes, J.: Projections for Strictness Analysis. In: Kahn, G. (ed.) FPCA 1987. LNCS, vol.\u00a0274, pp. 385\u2013407. Springer, Heidelberg (1987)"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Wadler, P.: The Essence of Functional Programming. In: Proc. POPL 1992: ACM Symp. on Principles of Prog. Langs., pp. 1\u201314 (January 1992)","DOI":"10.1145\/143165.143169"},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"Danielsson, N.A.: Lightweight Semiformal Time Complexity Analysis for Purely Functional Data Structures. In: Proc. POPL 2008: Symp. on Principles of Prog. Langs., San Francisco, USA, January 7-12, pp. 133\u2013144. ACM (2008)","DOI":"10.1145\/1328897.1328457"},{"key":"32_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-60675-0_35","volume-title":"Functional Programming Languages in Education","author":"D. Turner","year":"1995","unstructured":"Turner, D.: Elementary Strong Functional Programming. In: Hartel, P.H., Plasmeijer, R. (eds.) FPLE 1995. LNCS, vol.\u00a01022, pp. 1\u201313. Springer, Heidelberg (1995)"},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"Hughes, R., Pareto, L., Sabry, A.: Proving the Correctness of Reactive Systems Using Sized Types. In: ACM Symp. on Principles of Prog. Langs (POPL 1996), St. Petersburg Beach, USA, pp. 410\u2013423. ACM (January 1996)","DOI":"10.1145\/237721.240882"},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Hughes, R., Pareto, L.: Recursion and Dynamic Data Structures in Bounded Space: Towards Embedded ML Programming. In: Proc. 1999 ACM Intl. Conf. on Functional Programming (ICFP 1999), pp. 70\u201381 (1999)","DOI":"10.1145\/317765.317785"},{"key":"32_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/11964681_5","volume-title":"Implementation and Application of Functional Languages","author":"E. Brady","year":"2006","unstructured":"Brady, E., Hammond, K.: A Dependently Typed Framework for Static Analysis of Program Execution Costs. In: Butterfield, A., Grelck, C., Huch, F. (eds.) IFL 2005. LNCS, vol.\u00a04015, pp. 74\u201390. Springer, Heidelberg (2006)"},{"key":"32_CR23","unstructured":"Pena, R., Segura, C.: A First-Order Functl. Lang. for Reasoning about Heap Consumption. In: Draft Proc. Intl. Workshop on Impl. and Appl. of Functl. Langs. (IFL 2004), pp. 64\u201380 (2004)"},{"key":"32_CR24","unstructured":"Montenegro, M., Pena, R., Segura, C.: An Inference Algorithm for Guaranteeing Safe Destruction. In: Draft Proc. Trends in Functional Programming (TFP 2007), New York, April 2-4 (2007)"},{"issue":"3","key":"32_CR25","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1017\/S0956796800000393","volume":"2","author":"J.P. Talpin","year":"1992","unstructured":"Talpin, J.P., Jouvelot, P.: Polymorphic type, region and effect inference. J. Funct. Program.\u00a02(3), 245\u2013271 (1992)","journal-title":"J. Funct. Program."},{"key":"32_CR26","doi-asserted-by":"crossref","unstructured":"Nielson, F., Nielson, H.R., Amtoft, T.: Polymorphic subtyping for effect analysis: The algorithm. In: Logical and Operational Methods in the Analysis of Programs and Systems, pp. 207\u2013243 (1996)","DOI":"10.1007\/3-540-62503-8_10"},{"key":"32_CR27","doi-asserted-by":"crossref","unstructured":"Nielson, H.R., Nielson, F., Amtoft, T.: Polymorphic subtyping for effect analysis: The static semantics. In: Logical and Operational Methods in the Analysis of Programs and Systems, pp. 141\u2013171 (1996)","DOI":"10.1007\/3-540-62503-8_8"},{"key":"32_CR28","first-page":"207","volume-title":"ACM Symp. on Principles of Prog. Langs. (POPL 1982)","author":"L. Damas","year":"1982","unstructured":"Damas, L., Milner, R.: Principal type-schemes for functional programs. In: ACM Symp. on Principles of Prog. Langs (POPL 1982), pp. 207\u2013212. ACM, New York (1982)"},{"key":"32_CR29","doi-asserted-by":"crossref","unstructured":"Marlow, S., Jones, S.P.: Making a fast curry: push\/enter vs. eval\/apply for higher-order languages. In: Proc. of the ACM SIGPLAN 2004 Intl. Conf. on Functional Programming (ICFP 2004), pp. 4\u201315. ACM Press (January 2004)","DOI":"10.1145\/1016848.1016856"},{"key":"32_CR30","doi-asserted-by":"crossref","unstructured":"Hoffmann, J., Aehlig, K., Hofmann, M.: Multivariate Amortized Resource Analysis. ACM Trans. Program. Lang. Syst. 34(3), 14:1\u201314:62 (2012)","DOI":"10.1145\/2362389.2362393"},{"key":"32_CR31","doi-asserted-by":"crossref","unstructured":"Hofmann, M., Jost, S.: Static prediction of heap space usage for first-order functional programs. In: ACM Symp. on Principles of Prog. Langs (POPL 2003), pp. 185\u2013197. ACM (January 2003)","DOI":"10.1145\/640128.604148"},{"issue":"2","key":"32_CR32","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1996.2613","volume":"132","author":"M. Tofte","year":"1997","unstructured":"Tofte, M., Talpin, J.P.: Region-based memory management. Information and Computation\u00a0132(2), 109\u2013176 (1997)","journal-title":"Information and Computation"},{"key":"32_CR33","unstructured":"Tofte, M., et al.: Programming with regions in the ml kit, IT University of Copenhagen (April 2002), \n                    \n                      http:\/\/www.itu.dk\/research\/mlkit\/"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46669-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:35:33Z","timestamp":1559140533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46669-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662466681","9783662466698"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46669-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}