{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T09:18:10Z","timestamp":1725614290406},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642244513"},{"type":"electronic","value":"9783642244520"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24452-0_7","type":"book-chapter","created":{"date-parts":[[2011,9,26]],"date-time":"2011-09-26T01:52:52Z","timestamp":1317001972000},"page":"118-137","source":"Crossref","is-referenced-by-count":4,"title":["Collected Size Semantics for Functional Programs over Lists"],"prefix":"10.1007","author":[{"given":"Olha","family":"Shkaravska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marko","family":"van Eekelen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"Tamalet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-540-69166-2_15","volume-title":"Static Analysis","author":"E. Albert","year":"2008","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G.: Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis. In: Alpuente, M., Vidal, G. (eds.) SAS 2008. LNCS, vol.\u00a05079, pp. 221\u2013237. Springer, Heidelberg (2008)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-540-71316-6_12","volume-title":"Programming Languages and Systems","author":"E. Albert","year":"2007","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Cost Analysis of Java Bytecode. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.\u00a04421, pp. 157\u2013172. Springer, Heidelberg (2007)"},{"issue":"1-2","key":"7_CR3","first-page":"29","volume":"65","author":"R.M. Amadio","year":"2004","unstructured":"Amadio, R.M.: Synthesis of max-plus quasi-interpretations. Fundamenta Informaticae\u00a065(1-2), 29\u201360 (2004)","journal-title":"Fundamenta Informaticae"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/11741060_2","volume-title":"Construction and Analysis of Safe, Secure, and Interoperable Smart Devices","author":"D. Aspinall","year":"2006","unstructured":"Aspinall, D., MacKenzie, K.: Mobile Resource Guarantees and Policies. In: Barthe, G., Gr\u00e9goire, B., Huisman, M., Lanet, J.-L. (eds.) CASSIS 2005. LNCS, vol.\u00a03956, pp. 16\u201336. Springer, Heidelberg (2006)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Atassi, V., Baillot, P., Terui, K.: Verification of Ptime Reducibility for System F Terms: Type Inference in Dual Light Affine Logic. Logical Methods in Computer Science\u00a03(4) (2007)","DOI":"10.2168\/LMCS-3(4:10)2007"},{"key":"7_CR6","unstructured":"Bonfante, G., Marion, J.-Y., Moyen, J.-Y.: Quasi-interpretations, a way to control resources. Theoretical Computer Science (2005)"},{"key":"7_CR7","unstructured":"Campbell, B.: Space Cost Analysis Using Sized Types. PhD thesis, School of Informatics, University of Edinburgh (2008)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Chui, C.K., Lai, M.-J.: Vandermonde determinants and lagrange interpolation in R s . Nonlinear and Convex Analysis, 23\u201335 (1987)","DOI":"10.1201\/9781003420040-3"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Gaboardi, M., Marion, J.-Y., Ronchi Della Rocca, S.: A logical account of PSPACE. In: Proceedingsof the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages POPL 2008, San Francisco, January 10-12, pp. 121\u2013131 (2008)","DOI":"10.1145\/1328438.1328456"},{"key":"7_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-540-30210-0_16","volume-title":"Artificial Intelligence and Symbolic Computation","author":"N. Hirokawa","year":"2004","unstructured":"Hirokawa, N., Middeldorp, A.: Polynomial interpretations with negative coefficients. In: Buchberger, B., Campbell, J. (eds.) AISC 2004. LNCS (LNAI), vol.\u00a03249, pp. 185\u2013198. Springer, Heidelberg (2004)"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1145\/640128.604148","volume":"38","author":"M. Hofmann","year":"2003","unstructured":"Hofmann, M., Jost, S.: Static prediction of heap space usage for first-order functional programs. SIGPLAN Not.\u00a038(1), 185\u2013197 (2003)","journal-title":"SIGPLAN Not."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Okasaki, C.: Purely Functional Data Structures. Cambridge University Press, Cambridge (1998)","DOI":"10.1017\/CBO9780511530104"},{"key":"7_CR13","unstructured":"Shkaravska, O., van Eekelen, M., Tamalet, A.: Collected size semantics for functional programs. Technical Report ICIS-R08021, Radboud University Nijmegen (November 2008)"},{"key":"7_CR14","unstructured":"Shkaravska, O., van Eekelen, M., Tamalet, A.: Polynomial size complexity analysis with families of piecewise polynomials. Technical Report ICIS-R08020, Radboud University Nijmegen (November 2008)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-540-73228-0_25","volume-title":"Typed Lambda Calculi and Applications","author":"O. Shkaravska","year":"2007","unstructured":"Shkaravska, O., van Kesteren, R., van Eekelen, M.: Polynomial Size Analysis of First-Order Functions. In: Rocca, S.R.D. (ed.) TLCA 2007. LNCS, vol.\u00a04583, pp. 351\u2013366. Springer, Heidelberg (2007)"},{"key":"7_CR16","unstructured":"Tamalet, A., Shkaravska, O., van Eekelen, M.: Size Analysis of Algebraic Data Types. In: Moraz\u00e1n, M. (ed.) Selected Papers of the 9 th International Symposium on Trends in Functional Programming (TFP 2008). Intellect Publishers (2008) (to appear)"},{"key":"7_CR17","unstructured":"van Eekelen, M., Shkaravska, O., van Kesteren, R., Jacobs, B., Poll, E., Smetsers, S.: AHA: Amortized Heap Space Usage Analysis. In: Moraz\u00e1n, M. (ed.) Selected Papers of the 8 th International Symposium on Trends in Functional Programming (TFP 2007), New York, USA, pp. 36\u201353. Intellect Publishers, UK (2007)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"van Kesteren, R., Shkaravska, O., van Eekelen, M.: Inferring static non-monotonically sized types through testing. In: Proceedings of 16 th International Workshop on Functional and (Constraint) Logic Programming (WFLP 2007), Paris, France. ENTCS, vol.\u00a0216C, pp. 45\u201363 (2007)","DOI":"10.1016\/j.entcs.2008.06.033"},{"key":"7_CR19","unstructured":"Vasconcelos, P.B.: Space Cost Analysis Using Sized Types. PhD thesis, School of Computer Science, University of St. Andrews (August 2008)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Functional Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24452-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T20:56:52Z","timestamp":1686344212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24452-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642244513","9783642244520"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24452-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}