{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:11:22Z","timestamp":1742922682597,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476659"},{"type":"electronic","value":"9783662476666"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47666-6_28","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T07:46:47Z","timestamp":1434700007000},"page":"350-361","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Parsimonious Types and Non-uniform Computation"],"prefix":"10.1007","author":[{"given":"Damiano","family":"Mazza","sequence":"first","affiliation":[]},{"given":"Kazushige","family":"Terui","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"issue":"2","key":"28_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. 163(2), 409\u2013470 (2000)","journal-title":"Inf. Comput."},{"issue":"1","key":"28_CR2","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. 207(1), 41\u201362 (2009)","journal-title":"Inf. Comput."},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01201998","volume":"2","author":"S Bellantoni","year":"1992","unstructured":"Bellantoni, S., Cook, S.A.: A new recursion-theoretic characterization of the polytime functions. Computational Complexity 2, 97\u2013110 (1992)","journal-title":"Computational Complexity"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.entcs.2004.06.060","volume":"123","author":"T Ehrhard","year":"2005","unstructured":"Ehrhard, T., Regnier, L.: Differential interaction nets. Electr. Notes Theor. Comput. Sci. 123, 35\u201374 (2005)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"2\u20133","key":"28_CR5","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.tcs.2008.06.001","volume":"403","author":"T Ehrhard","year":"2008","unstructured":"Ehrhard, T., Regnier, L.: Uniformity and the taylor expansion of ordinary lambda-terms. Theor. Comput. Sci. 403(2\u20133), 347\u2013372 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR6","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. 5771, pp. 271\u2013286. Springer, Heidelberg (2009)"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Ghica, D.R.: Geometry of synthesis: a structured approach to VLSI design. In: Proceedings of POPL, pp. 363\u2013375 (2007)","DOI":"10.1145\/1190215.1190269"},{"key":"28_CR8","first-page":"221","volume":"1988","author":"JY Girard","year":"1989","unstructured":"Girard, J.Y.: Geometry of interaction I: Interpretation of system F. Proccedings of Logic Colloquium 1988, 221\u2013260 (1989)","journal-title":"Proccedings of Logic Colloquium"},{"issue":"2","key":"28_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1006\/inco.1998.2700","volume":"143","author":"JY Girard","year":"1998","unstructured":"Girard, J.Y.: Light linear logic. Inf. Comput. 143(2), 175\u2013204 (1998)","journal-title":"Inf. Comput."},{"issue":"3","key":"28_CR10","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1093\/logcom\/10.3.411","volume":"10","author":"AJ Kfoury","year":"2000","unstructured":"Kfoury, A.J.: A linearization of the lambda-calculus and consequences. J. Log. Comput. 10(3), 411\u2013436 (2000)","journal-title":"J. Log. Comput."},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Leivant, D., Marion, J.Y.: Lambda calculus characterizations of poly-time. Fundam. Inform. 19(1\/2) (1993)","DOI":"10.3233\/FI-1993-191-207"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Mazza, D.: An infinitary affine lambda-calculus isomorphic to the full lambda-calculus. In: Proceedings of LICS, pp. 471\u2013480 (2012)","DOI":"10.1109\/LICS.2012.57"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/978-3-662-43951-7_26","volume-title":"Automata, Languages, and Programming","author":"D Mazza","year":"2014","unstructured":"Mazza, D.: Non-uniform polytime computation in the infinitary affine lambda-calculus. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol. 8573, pp. 305\u2013317. Springer, Heidelberg (2014)"},{"key":"28_CR14","unstructured":"Mazza, D.: Simple parsimonious types and logarithmic space (2015), available on the author\u2019s web page"},{"issue":"2\u20133","key":"28_CR15","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.tcs.2006.01.016","volume":"358","author":"PA Melli\u00e8s","year":"2006","unstructured":"Melli\u00e8s, P.A.: Asynchronous games 2: The true concurrency of innocence. Theor. Comput. Sci. 358(2\u20133), 200\u2013228 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-642-02930-1_21","volume-title":"Automata, Languages and Programming","author":"P-A Melli\u00e8s","year":"2009","unstructured":"Melli\u00e8s, P.-A., Tabareau, N., Tasson, C.: An explicit formula for the free exponential modality of linear logic. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol. 5556, pp. 247\u2013260. Springer, Heidelberg (2009)"},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.entcs.2011.09.025","volume":"276","author":"R Ramyaa","year":"2011","unstructured":"Ramyaa, R., Leivant, D.: Ramified corecurrence and logspace. Electr. Notes Theor. Comput. Sci. 276, 247\u2013261 (2011)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Saurin, A.: Typing streams in the $$\\Lambda \\mu $$-calculus. ACM Trans. Comput. Log. 11(4) (2010)","DOI":"10.1145\/1805950.1805958"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Terui, K.: Proof nets and boolean circuits. In: Proceedings of LICS, pp. 182\u2013191 (2004)","DOI":"10.1109\/LICS.2004.1319612"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Vollmer, H.: Introduction to circuit complexity - a uniform approach. Texts in theoretical computer science. Springer (1999)","DOI":"10.1007\/978-3-662-03927-4"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47666-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T02:08:51Z","timestamp":1676945331000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47666-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476659","9783662476666"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47666-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}