{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:59:53Z","timestamp":1725569993695},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642171635"},{"type":"electronic","value":"9783642171642"}],"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-17164-2_26","type":"book-chapter","created":{"date-parts":[[2010,11,19]],"date-time":"2010-11-19T05:54:39Z","timestamp":1290146079000},"page":"376-391","source":"Crossref","is-referenced-by-count":3,"title":["Type Inference for Sublinear\u00a0Space\u00a0Functional\u00a0Programming"],"prefix":"10.1007","author":[{"given":"Ugo","family":"Dal Lago","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Sch\u00f6pp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"26_CR1","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/inco.2000.2930","volume":"163","author":"S. Abramsky","year":"2000","unstructured":"Abramsky, S., Jagadeesan, R., Malacaria, P.: Full Abstraction for PCF. Inf. Comput.\u00a0163(2), 409\u2013470 (2000)","journal-title":"Inf. Comput."},{"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)","key":"26_CR2","DOI":"10.2168\/LMCS-3(4:10)2007"},{"doi-asserted-by":"crossref","unstructured":"Baader, F., Snyder, W.: Unification theory. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 445\u2013532. Elsevier and MIT Press (2001)","key":"26_CR3","DOI":"10.1016\/B978-044450813-3\/50010-2"},{"unstructured":"Burrell, M.J., Cockett, R., Redmond, B.F.: Pola: a language for PTIME programming. In: Workshop on Logic and Computational Complexity, LCC (2009)","key":"26_CR4"},{"issue":"3","key":"26_CR5","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0196-6774(87)90018-6","volume":"8","author":"S. Cook","year":"1987","unstructured":"Cook, S., McKenzie, P.: Problems complete for deterministic logarithmic space. Journal of Algorithms\u00a08(3), 385\u2013394 (1987)","journal-title":"Journal of Algorithms"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-11957-6_12","volume-title":"Programming Languages and Systems","author":"U. Lago Dal","year":"2010","unstructured":"Dal Lago, U., Sch\u00f6pp, U.: Functional programming in sublinear space. In: Gordon, A.D. (ed.) Programming Languages and Systems. LNCS, vol.\u00a06012, pp. 205\u2013225. Springer, Heidelberg (2010)"},{"issue":"2","key":"26_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1006136609427","volume":"23","author":"M. Hermann","year":"1999","unstructured":"Hermann, M., Kolaitis, P.G.: Computational complexity of simultaneous elementary matching problems. J. Autom. Reasoning\u00a023(2), 107\u2013136 (1999)","journal-title":"J. Autom. Reasoning"},{"issue":"2","key":"26_CR8","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF00245463","volume":"9","author":"D. Kapur","year":"1992","unstructured":"Kapur, D., Narendran, P.: Complexity of unification problems with associative-commutative operators. J. Autom. Reasoning\u00a09(2), 261\u2013288 (1992)","journal-title":"J. Autom. Reasoning"},{"key":"26_CR9","first-page":"389","volume-title":"Advanced Topics in Types and Programming Languages","author":"F. Pottier","year":"2005","unstructured":"Pottier, F., R\u00e9my, D.: The essence of ML type inference. In: Pierce, B.C. (ed.) Advanced Topics in Types and Programming Languages, pp. 389\u2013489. MIT Press, Cambridge (2005)"},{"issue":"1\/2","key":"26_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0747-7171(87)80026-3","volume":"3","author":"E. Tid\u00e9n","year":"1987","unstructured":"Tid\u00e9n, E., Arnborg, S.: Unification problems with one-sided distributivity. J. Symb. Comput.\u00a03(1\/2), 183\u2013202 (1987)","journal-title":"J. Symb. Comput."}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17164-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T05:31:17Z","timestamp":1553232677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17164-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642171635","9783642171642"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17164-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}