{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:58:25Z","timestamp":1725487105389},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540732273"},{"type":"electronic","value":"9783540732280"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73228-0_25","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:57:11Z","timestamp":1184601431000},"page":"351-365","source":"Crossref","is-referenced-by-count":13,"title":["Polynomial Size Analysis of First-Order Functions"],"prefix":"10.1007","author":[{"given":"Olha","family":"Shkaravska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ron","family":"van Kesteren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marko","family":"van Eekelen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Bonfante, G., Marion, J.-Y., Moyen, J.-Y.: Quasi-interpretations, a way to control resources. Theoretical Computer Science (to appear)","DOI":"10.1016\/j.tcs.2011.02.007"},{"key":"25_CR2","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1017\/S0960129500070109","volume":"6","author":"E. Barendsen","year":"1996","unstructured":"Barendsen, E., Smetsers, S.: Uniqueness typing for functional languages with graph rewriting semantics. Mathematical Structures in Computer Science\u00a06, 579\u2013612 (1996)","journal-title":"Mathematical Structures in Computer Science"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Chatterjee, S., Blelloch, G.E., Fischer, A.L.: Size and access inference for data-parallel programs. In: PLDI \u201991. Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation, pp. 130\u2013144 (1991)","DOI":"10.1145\/113445.113457"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Chui, C., Lai, H.C.: Vandermonde determinant and Lagrange interpolation in R s . Nonlinear and convex analysis, 23\u201335 ( 1987)","DOI":"10.1201\/9781003420040-3"},{"issue":"1","key":"25_CR5","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":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/3-540-44806-3_12","volume-title":"Semantics, Applications, and Implementation of Program Generation","author":"C.A. Herrmann","year":"2001","unstructured":"Herrmann, C.A., Lengauer, C.: A transformational approach which combines size inference and program optimization. In: Taha, W. (ed.) SAIG 2001. LNCS, vol.\u00a02196, pp. 199\u2013218. Springer, Heidelberg (2001)"},{"key":"25_CR7","unstructured":"Jay, C.B., Sekanina, M.: Shape checking of array programs. In: Computing: the Australasian Theory Seminar, Proceedings. Australian Computer Science Communications, vol.\u00a019, pp. 113\u2013121 (1997)"},{"key":"25_CR8","unstructured":"Pareto, L.: Sized Types. Dissertation for the Licentiate Degree in Computing Science. Chalmers University of Technology (1998)"},{"key":"25_CR9","series-title":"Lecture Notes in Math","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0088788","volume-title":"Multivariate Birkhoff Interpolation","author":"R.A. Lorenz","year":"1992","unstructured":"Lorenz, R.A.: SAFECOMP 1998. Lecture Notes in Math, vol.\u00a01516. Springer, Heidelberg (1992)"},{"issue":"10","key":"25_CR10","first-page":"689","volume":"98","author":"Y.. Matiyasevich","year":"1991","unstructured":"Matiyasevich, Y., Jones, J.-P.: Proof or recursive unsolvability of Hilbert\u2019s tenth problem. American Mathematical Monthly\u00a098(10), 689\u2013709 (1991)","journal-title":"American Mathematical Monthly"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Shkaravska, O., van Kesteren, R., van Eekelen, M.: polynomial size analysis of first-order functions. Technical Report ICIS-R07004, Radboud University Nijmegen (2007)","DOI":"10.1007\/978-3-540-73228-0_25"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/978-3-540-27861-0_6","volume-title":"Implementation of Functional Languages","author":"P.-B. Vasconcelos","year":"2004","unstructured":"Vasconcelos, P.-B., Hammond, K.: Inferring cost equations for recursive, polymorphic and higher-order functional programs. In: Trinder, P., Michaelson, G.J., Pe\u00f1a, R. (eds.) IFL 2003. LNCS, vol.\u00a03145, pp. 86\u2013101. Springer, Heidelberg (Revised Papers) (2004)"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73228-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T10:29:09Z","timestamp":1683973749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73228-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540732273","9783540732280"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73228-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}