{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:09:29Z","timestamp":1725566969508},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540304951"},{"type":"electronic","value":"9783540324195"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11590156_15","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T10:43:16Z","timestamp":1133779396000},"page":"189-200","source":"Crossref","is-referenced-by-count":7,"title":["Quantitative Models and Implicit Complexity"],"prefix":"10.1007","author":[{"given":"Ugo","family":"Dal Lago","sequence":"first","affiliation":[]},{"given":"Martin","family":"Hofmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"15_CR1","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 Transactions on Computational Logic\u00a03(1), 137\u2013175 (2002)","journal-title":"ACM Transactions on Computational Logic"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Baillot, P., Mogbil, V.: Soft lambda-calculus: a language for polynomial time computation. In: Proceedings of the 7th International Conference on Foundations of Software Science and Computational Structures (2004)","DOI":"10.1007\/978-3-540-24727-2_4"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0168-0072(00)00006-3","volume":"104","author":"S. Bellantoni","year":"2000","unstructured":"Bellantoni, S., Niggl, K.H., Schwichtenberg, H.: Higher type recursion, ramification and polynomial time. Annals of Pure and Applied Logic\u00a0104, 17\u201330 (2000)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"2","key":"15_CR4","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0168-0072(93)90044-E","volume":"63","author":"S. Cook","year":"1993","unstructured":"Cook, S., Urquhart, A.: Functional interpretations of feasible constructive arithmetic. Annals of Pure and Applied Logic\u00a063(2), 103\u2013200 (1993)","journal-title":"Annals of Pure and Applied Logic"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Coppola, P., Martini, S.: Typing lambda terms in elementary logic with linear constraints. In: Proceedings of the 6th International Conference on Typed Lambda-Calculus and Applications, pp. 76\u201390 (2001)","DOI":"10.1007\/3-540-45413-6_10"},{"key":"15_CR6","first-page":"279","volume":"3","author":"J. Crossley","year":"1994","unstructured":"Crossley, J., Mathai, G., Seely, R.: A logical calculus for polynomialtime realizability. Journal of Methods of Logic in Computer Science\u00a03, 279\u2013298 (1994)","journal-title":"Journal of Methods of Logic in Computer Science"},{"key":"15_CR7","unstructured":"Lago, U.D., Hofmann, M.: Quantitative models and implicit complexity. Arxiv Preprint (2005), Available from \n \n http:\/\/arxiv.org\/cs.LO\/0506079"},{"issue":"2","key":"15_CR8","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":"15_CR9","doi-asserted-by":"crossref","unstructured":"Hofmann, M.: Linear types and non-size-increasing polynomial time computation. In: Proceedings of the 14th IEEE Syposium on Logic in Computer Science, pp. 464\u2013473 (1999)","DOI":"10.1109\/LICS.1999.782641"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0168-0072(00)00010-5","volume":"104","author":"M. Hofmann Safe","year":"2000","unstructured":"Hofmann Safe, M.: recursion with higher types and BCK-algebra. Annals of Pure and Applied Logic\u00a0104, 113\u2013166 (2000)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"1-2","key":"15_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.tcs.2003.10.019","volume":"318","author":"M. Hofmann","year":"2004","unstructured":"Hofmann, M., Scott, P.: Realizability models for BLL-like languages. Theoretical Computer Science\u00a0318(1-2), 121\u2013137 (2004)","journal-title":"Theoretical Computer Science"},{"key":"15_CR12","first-page":"101","volume-title":"Constructivity in Mathematics","author":"G. Kreisel","year":"1959","unstructured":"Kreisel, G.: Interpretation of analysis by means of constructive functions of finite types. In: Heyting, A. (ed.) Constructivity in Mathematics, pp. 101\u2013128. North-Holland, Amsterdam (1959)"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.tcs.2003.10.018","volume":"318","author":"Y. Lafont Soft","year":"2004","unstructured":"Lafont Soft, Y.: linear logic and polynomial time. Theoretical Computer Science\u00a0318, 163\u2013180 (2004)","journal-title":"Theoretical Computer Science"},{"key":"15_CR14","series-title":"Algorithms and Complexity","first-page":"1","volume-title":"Handbook of Theoretical Computer Science","author":"P. Emde Boas van","year":"1990","unstructured":"van Emde Boas, P.: Machine models and simulation. In: Handbook of Theoretical Computer Science. Algorithms and Complexity, vol.\u00a0A, pp. 1\u201366. Elsevier, Amsterdam (1990)"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Xi, H., Pfenning, F.: Dependent types in practical programming. In: Proceedings of the 26th ACM SIGPLAN Symposium on Principles of Programming Languages, pp. 214\u2013227 (1999)","DOI":"10.1145\/292540.292560"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11590156_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T03:47:39Z","timestamp":1553140059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11590156_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304951","9783540324195"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11590156_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}
