{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T14:54:08Z","timestamp":1791125648584,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540926863","type":"print"},{"value":"9783540926870","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92687-0_10","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T09:25:38Z","timestamp":1234257938000},"page":"137-151","source":"Crossref","is-referenced-by-count":2,"title":["Taming Modal Impredicativity: Superlazy Reduction"],"prefix":"10.1007","author":[{"given":"Ugo","family":"Dal Lago","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luca","family":"Roversi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luca","family":"Vercelli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"10_CR1","first-page":"366","volume-title":"Proc. 20th Annual Symposium on Logic in Computer Science","author":"U. Lago Dal","year":"2005","unstructured":"Dal Lago, U.: The geometry of linear higher-order recursion. In: Proc. 20th Annual Symposium on Logic in Computer Science, pp. 366\u2013375. IEEE Computer Society, Los Alamitos (2005)"},{"key":"10_CR2","unstructured":"Dal Lago, U., Roversi, L., Vercelli, L.: Taming modal impredicativity: Superlazy reduction. Extended Version (2008), \n                  \n                    http:\/\/arxiv.org\/abs\/0810.2891"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1093\/0195148770.003.0019","volume-title":"The Oxford Handbook of the Philosophy of Mathematics and Logic","author":"S. Feferman","year":"2005","unstructured":"Feferman, S.: Predicativity. In: Shapiro, S. (ed.) The Oxford Handbook of the Philosophy of Mathematics and Logic, pp. 590\u2013624. Oxford University Press, Oxford (2005)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(92)90386-T","volume":"97","author":"J.-Y. Girard","year":"1992","unstructured":"Girard, J.-Y., Scedrov, A., Scott, P.: Bounded linear logic: A modular approach to polynomial time computability. Theor. Comput. Sci.\u00a097, 1\u201366 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Girard, J.-Y.: Geometry of interaction 1: interpretation of system F. In: Proc. Logic Colloquium 1988, pp. 221\u2013260 (1989)","DOI":"10.1016\/S0049-237X(08)70271-4"},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1006\/inco.1998.2700","volume":"143","author":"J.-Y. Girard","year":"1998","unstructured":"Girard, J.-Y.: Light linear logic. Information and Computation\u00a0143(2), 175\u2013204 (1998)","journal-title":"Information and Computation"},{"key":"10_CR7","first-page":"464","volume-title":"Proceedings of the 14th Symposium on Logic in Computer Science","author":"M. Hofmann","year":"1999","unstructured":"Hofmann, M.: Linear types and non-size-increasing polynomial time computation. In: Proceedings of the 14th Symposium on Logic in Computer Science, pp. 464\u2013473. IEEE Computer Society, Los Alamitos (1999)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.tcs.2003.10.018","volume":"318","author":"Y. Lafont","year":"2004","unstructured":"Lafont, Y.: Soft linear logic and polynomial time. Theor. Comput. Sci.\u00a0318, 163\u2013180 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Leivant, D.: Stratified functional programs and computational complexity. In: Proceedings of 20th ACM Symposium on Principles of Programming Languages, pp. 325\u2013333 (1993)","DOI":"10.1145\/158511.158659"},{"issue":"1-3","key":"10_CR10","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0168-0072(98)00040-2","volume":"96","author":"D. Leivant","year":"1999","unstructured":"Leivant, D.: Ramified recurrence and computational complexity III: Higher type recurrence and elementary complexity. Ann. Pure Appl. Logic\u00a096(1-3), 209\u2013229 (1999)","journal-title":"Ann. Pure Appl. Logic"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1017\/S0960129599002868","volume":"9","author":"D. Leivant","year":"1999","unstructured":"Leivant, D., Danner, N.: Stratified polymorphism and primitive recursion. Math. Struct. in Comp. Science\u00a09, 507\u2013522 (1999)","journal-title":"Math. Struct. in Comp. Science"},{"issue":"1-2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0304-3975(99)00209-1","volume":"236","author":"D. Leivant","year":"2000","unstructured":"Leivant, D., Marion, J.-Y.: A characterization of alternating log time by ramified recurrence. Theor. Comput. Sci.\u00a0236(1-2), 193\u2013208 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(94)90263-1","volume":"135","author":"G. Mascari","year":"1994","unstructured":"Mascari, G., Pedicini, M.: Head linear reduction and pure proof net extraction. Theor. Comput. Sci.\u00a0135(1), 111\u2013137 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"321","DOI":"10.2178\/bsl\/1122038991","volume":"11","author":"H. Simmons","year":"2005","unstructured":"Simmons, H.: Tiering as a recursion technique. Bulletin of Symbolic Logic\u00a011(3), 321\u2013350 (2005)","journal-title":"Bulletin of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92687-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T08:20:30Z","timestamp":1551774030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92687-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540926863","9783540926870"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92687-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}