{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:21:38Z","timestamp":1725891698999},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153303"},{"type":"electronic","value":"9783642153310"}],"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-15331-0_8","type":"book-chapter","created":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T05:11:25Z","timestamp":1283836285000},"page":"114-130","source":"Crossref","is-referenced-by-count":0,"title":["A Local Criterion for Polynomial-Time Stratified Computations"],"prefix":"10.1007","author":[{"given":"Luca","family":"Roversi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Vercelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01201998","volume":"2","author":"S. Bellantoni","year":"1992","unstructured":"Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the polytime functions. Computational Complexity\u00a02, 97\u2013110 (1992)","journal-title":"Computational Complexity"},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/504077.504081","volume":"3","author":"A. Asperti","year":"2002","unstructured":"Asperti, A., Roversi, L.: Intuitionistic light affine logic. ACM Trans. Comput. Log.\u00a03(1), 137\u2013175 (2002)","journal-title":"ACM Trans. Comput. Log."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.Y. Girard","year":"1987","unstructured":"Girard, J.Y.: Linear Logic. Theo. Comp. Sci.\u00a050, 1\u2013102 (1987)","journal-title":"Theo. Comp. Sci."},{"issue":"12","key":"8_CR4","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.tcs.2003.10.017","volume":"318","author":"A.S. Murawski","year":"2004","unstructured":"Murawski, A.S., Ong, C.H.L.: On an interpretation of safe recursion in light affine logic. Theor. Comput. Sci.\u00a0318(12), 197\u2013223 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"3-4","key":"8_CR5","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s00153-007-0042-6","volume":"46","author":"K. Terui","year":"2007","unstructured":"Terui, K.: Light affine lambda calculus and polynomial time strong normalization. Arch. Math. Logic\u00a046(3-4), 253\u2013280 (2007)","journal-title":"Arch. Math. Logic"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s001530050054","volume":"36","author":"A. Beckmann","year":"1996","unstructured":"Beckmann, A., Weiermann, A.: A term rewriting characterization of the polytime functions and related complexity classes. Arch. Math. Logic\u00a036(1), 11\u201330 (1996)","journal-title":"Arch. Math. Logic"},{"issue":"2","key":"8_CR7","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. Inf. Comput.\u00a0143(2), 175\u2013204 (1998)","journal-title":"Inf. Comput."},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-642-02444-3_19","volume-title":"Types for Proofs and Programs","author":"L. Roversi","year":"2009","unstructured":"Roversi, L., Vercelli, L.: Some Complexity and Expressiveness results on Multimodal and Stratified Proof-nets. In: Berardi, S., Damiani, F., de\u2019Liguoro, U. (eds.) TYPES 2008. LNCS, vol.\u00a05497, pp. 306\u2013322. Springer, Heidelberg (2009)"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Dal Lago, U.: Context semantics, linear logic and computational complexity. ACM Transactions on Computational Logic\u00a010(4) (2009)","DOI":"10.1145\/1555746.1555749"}],"container-title":["Lecture Notes in Computer Science","Foundational and Practical Aspects of Resource Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15331-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T20:42:01Z","timestamp":1559594521000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15331-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153303","9783642153310"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15331-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}