{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:22:14Z","timestamp":1726410134264},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153303"},{"type":"electronic","value":"9783642153310"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15331-0_4","type":"book-chapter","created":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T09:11:25Z","timestamp":1283850685000},"page":"51-66","source":"Crossref","is-referenced-by-count":0,"title":["Global and Local Space Properties of Stream Programs"],"prefix":"10.1007","author":[{"given":"Marco","family":"Gaboardi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romain","family":"P\u00e9choux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-642-04027-6_21","volume-title":"Computer Science Logic","author":"M. Gaboardi","year":"2009","unstructured":"Gaboardi, M., P\u00e9choux, R.: Upper bounds on stream I\/O using semantic interpretations. In: Gr\u00e4del, E., Kahle, R. (eds.) CSL 2009. LNCS, vol.\u00a05771, pp. 271\u2013286. Springer, Heidelberg (2009)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-53904-2_81","volume-title":"Rewriting Techniques and Applications","author":"J. Kennaway","year":"1991","unstructured":"Kennaway, J., Klop, J., Sleep, M., de Vries, F.: Transfinite Reductions in Orthogonal Term Rewriting Systems. In: Book, R.V. (ed.) RTA 1991. LNCS, vol.\u00a0488, pp. 1\u201312. Springer, Heidelberg (1991)"},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(96)00171-5","volume":"175","author":"J. Kennaway","year":"1997","unstructured":"Kennaway, J., Klop, J., Sleep, M., de Vries, F.: Infinitary lambda calculus. TCS\u00a0175(1), 93\u2013125 (1997)","journal-title":"TCS"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BFb0052087","volume-title":"Foundations of Computer Science","author":"K. Weihrauch","year":"1997","unstructured":"Weihrauch, K.: A foundation for computable analysis. In: Freksa, C., Jantzen, M., Valk, R. (eds.) Foundations of Computer Science. LNCS, vol.\u00a01337, pp. 185\u2013199. Springer, Heidelberg (1997)"},{"key":"4_CR5","first-page":"95","volume-title":"POPL\u201976","author":"P. Henderson","year":"1976","unstructured":"Henderson, P., Morris, J.: A lazy evaluator. In: POPL\u201976, pp. 95\u2013103. ACM, New York (1976)"},{"key":"4_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526619","volume-title":"Semantics and Logics of Computation","author":"A.M. Pitts","year":"1997","unstructured":"Pitts, A.M.: Operationally-based theories of program equivalence. In: Semantics and Logics of Computation. Cambridge University Press, Cambridge (1997)"},{"issue":"1-2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0304-3975(98)00353-3","volume":"228","author":"A. Gordon","year":"1999","unstructured":"Gordon, A.: Bisimilarity as a theory of functional programming. TCS\u00a0228(1-2), 5\u201347 (1999)","journal-title":"TCS"},{"unstructured":"Dijkstra, E.W.: On the productivity of recursive definitions. EWD\u00a0749 (1980)","key":"4_CR8"},{"issue":"4","key":"4_CR9","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1145\/69558.69563","volume":"11","author":"B. Sijtsma","year":"1989","unstructured":"Sijtsma, B.: On the productivity of recursive list definitions. ACM TOPLAS\u00a011(4), 633\u2013649 (1989)","journal-title":"ACM TOPLAS"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-58085-9_72","volume-title":"Types for Proofs and Programs","author":"T. Coquand","year":"1994","unstructured":"Coquand, T.: Infinite objects in type theory. In: Barendregt, H., Nipkow, T. (eds.) TYPES 1993. LNCS, vol.\u00a0806, pp. 62\u201378. Springer, Heidelberg (1994)"},{"key":"4_CR11","first-page":"410","volume-title":"POPL\u201996","author":"J. Hughes","year":"1996","unstructured":"Hughes, J., Pareto, L., Sabry, A.: Proving the correctness of reactive systems using sized types. In: POPL\u201996, pp. 410\u2013423. ACM, New York (1996)"},{"issue":"1-2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.apal.2005.05.006","volume":"136","author":"W. Buchholz","year":"2005","unstructured":"Buchholz, W.: A term calculus for (co-) recursive definitions on streamlike data structures. Annals of Pure and Applied Logic\u00a0136(1-2), 75\u201390 (2005)","journal-title":"Annals of Pure and Applied Logic"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-540-74240-1_24","volume-title":"Fundamentals of Computation Theory","author":"J. Endrullis","year":"2007","unstructured":"Endrullis, J., Grabmayer, C., Hendriks, D., Isihara, A., Klop, J.: Productivity of Stream Definitions. In: Csuhaj-Varj\u00fa, E., \u00c9sik, Z. (eds.) FCT 2007. LNCS, vol.\u00a04639, pp. 274\u2013287. Springer, Heidelberg (2007)"},{"key":"4_CR14","first-page":"278","volume-title":"HICSS 2003","author":"S. Frankau","year":"2003","unstructured":"Frankau, S., Mycroft, A.: Stream processing hardware from functional language specifications. In: HICSS 2003, pp. 278\u2013287. IEEE, Los Alamitos (2003)"},{"unstructured":"Shkaravska, O., van Eekelen, M., Tamalet, A.: Collected Size Semantics for Functional Programs over Polymorphic Nested Lists. Technical Report ICIS\u2013R09003, Radboud University Nijmegen (2009)","key":"4_CR15"},{"unstructured":"Burrell, M.J., Cockett, R., Redmond, B.F.: Pola: a language for PTIME programming. In: LCC 2009, LICS Workshop (2009)","key":"4_CR16"},{"doi-asserted-by":"crossref","unstructured":"Bonfante, G., Marion, J.Y., Moyen, J.Y.: Quasi-interpretations, a way to control resources. TCS - Accepted","key":"4_CR17","DOI":"10.1016\/j.tcs.2011.02.007"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11737414_12","volume-title":"Functional and Logic Programming","author":"J.Y. Marion","year":"2006","unstructured":"Marion, J.Y., P\u00e9choux, R.: Resource analysis by sup-interpretation. In: Hagiya, M., Wadler, P. (eds.) FLOPS 2006. LNCS, vol.\u00a03945, pp. 163\u2013176. Springer, Heidelberg (2006)"},{"issue":"1-2","key":"4_CR19","first-page":"29","volume":"65","author":"R. Amadio","year":"2005","unstructured":"Amadio, R.: Synthesis of max-plus quasi-interpretations. Fundamenta Informaticae\u00a065(1-2), 29\u201360 (2005)","journal-title":"Fundamenta Informaticae"},{"unstructured":"Bonfante, G., Marion, J.Y., Moyen, J.Y., P\u00e9choux, R.: Synthesis of quasi-interpretations. In: LCC 2005, LICS Workshop (2005), http:\/\/hal.inria.fr\/","key":"4_CR20"},{"key":"4_CR21","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1145\/1389449.1389460","volume-title":"PPDP\u201908","author":"J.Y. Marion","year":"2008","unstructured":"Marion, J.Y., P\u00e9choux, R.: Characterizations of polynomial complexity classes with a better intensionality. In: PPDP\u201908, pp. 79\u201388. ACM, New York (2008)"}],"container-title":["Lecture Notes in Computer Science","Foundational and Practical Aspects of Resource Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15331-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T06:05:58Z","timestamp":1685772358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15331-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153303","9783642153310"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15331-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}