{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T05:36:23Z","timestamp":1794375383588,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642119569","type":"print"},{"value":"9783642119576","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11957-6_12","type":"book-chapter","created":{"date-parts":[[2010,3,7]],"date-time":"2010-03-07T19:55:38Z","timestamp":1267991738000},"page":"205-225","source":"Crossref","is-referenced-by-count":18,"title":["Functional Programming in Sublinear Space"],"prefix":"10.1007","author":[{"given":"Ugo","family":"Dal Lago","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ulrich","family":"Sch\u00f6pp","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1006\/inco.1994.1041","volume":"111","author":"S. Abramsky","year":"1994","unstructured":"Abramsky, S., Jagadeesan, R.: New Foundations for the Geometry of Interaction. Inf. Comput.\u00a0111(1), 53\u2013119 (1994)","journal-title":"Inf. Comput."},{"issue":"5","key":"12_CR2","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1017\/S0960129502003730","volume":"12","author":"S. Abramsky","year":"2002","unstructured":"Abramsky, S., Haghverdi, E., Scott, P.J.: Geometry of interaction and linear combinatory algebras. Math. Struct. in Comput. Sci.\u00a012(5), 625\u2013665 (2002)","journal-title":"Math. Struct. in Comput. Sci."},{"key":"12_CR3","volume-title":"The optimal implementation of functional programming languages","author":"A. Asperti","year":"1998","unstructured":"Asperti, A., Guerrini, S.: The optimal implementation of functional programming languages. Cambridge University Press, Cambridge (1998)"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ic.2008.08.005","volume":"207","author":"P. Baillot","year":"2009","unstructured":"Baillot, P., Terui, K.: Light types for polynomial time computation in lambda calculus. Inf. Comput.\u00a0207(1), 41\u201362 (2009)","journal-title":"Inf. Comput."},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/11784180_8","volume-title":"Algebraic Methodology and Software Technology","author":"G. Bonfante","year":"2006","unstructured":"Bonfante, G.: Some programming languages for Logspace and Ptime. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol.\u00a04019, pp. 66\u201380. Springer, Heidelberg (2006)"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1017\/S0960129508007184","volume":"19","author":"M. Hasegawa","year":"2009","unstructured":"Hasegawa, M.: On traced monoidal closed categories. Math. Struct. in Comput. Sci.\u00a019(2), 217\u2013244 (2009)","journal-title":"Math. Struct. in Comput. Sci."},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1017\/S0305004100074338","volume":"119","author":"A. Joyal","year":"1996","unstructured":"Joyal, A., Street, R., Verity, D.: Traced monoidal categories. Math. Proc. Cambridge Philos. Soc.\u00a0119(3), 447\u2013468 (1996)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-540-70583-3_23","volume-title":"Automata, Languages and Programming","author":"S. Katsumata","year":"2008","unstructured":"Katsumata, S.: Attribute grammars and categorical semantics. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 271\u2013282. Springer, Heidelberg (2008)"},{"key":"12_CR9","unstructured":"Katsumata, S., Hoshino, N.: Int construction and semibiproducts. RIMS-Technical Report 1676 (2009)"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/s00037-005-0191-0","volume":"14","author":"L. Kristiansen","year":"2005","unstructured":"Kristiansen, L.: Neat function algebraic characterizations of logspace and linspace. Computational Complexity\u00a014, 72\u201388 (2005)","journal-title":"Computational Complexity"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Mackie, I.: The geometry of interaction machine. In: POPL, pp. 198\u2013208 (1995)","DOI":"10.1145\/199448.199483"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-36206-1_2","volume-title":"FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science","author":"H.G. Mairson","year":"2002","unstructured":"Mairson, H.G.: From hilbert spaces to dilbert spaces: Context semantics made simple. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol.\u00a02556, pp. 2\u201317. Springer, Heidelberg (2002)"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11874683_1","volume-title":"Computer Science Logic","author":"P.A. Melli\u00e8s","year":"2006","unstructured":"Melli\u00e8s, P.A.: Functorial boxes in string diagrams. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 1\u201330. Springer, Heidelberg (2006)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-30477-7_21","volume-title":"Programming Languages and Systems","author":"P.M. Neergaard","year":"2004","unstructured":"Neergaard, P.M.: A functional language for logarithmic space. In: Chin, W.-N. (ed.) APLAS 2004. LNCS, vol.\u00a03302, pp. 311\u2013326. Springer, Heidelberg (2004)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Sch\u00f6pp, U.: Stratified bounded affine logic for logarithmic space. In: LICS, pp. 411\u2013420 (2007)","DOI":"10.1109\/LICS.2007.45"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-58355-6","volume-title":"Turing Machines with Sublogarithmic Space","author":"A. Szepietowski","year":"1994","unstructured":"Szepietowski, A.: Turing Machines with Sublogarithmic Space. LNCS, vol.\u00a0843. Springer, Heidelberg (1994)"},{"key":"12_CR17","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3054.001.0001","volume-title":"The Formal Semantics of Programming Languages","author":"G. Winskel","year":"1993","unstructured":"Winskel, G.: The Formal Semantics of Programming Languages. MIT Press, Cambridge (1993)"}],"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-11957-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,28]],"date-time":"2020-05-28T19:37:49Z","timestamp":1590694669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11957-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642119569","9783642119576"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11957-6_12","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-11957-6","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}