{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T04:30:22Z","timestamp":1791088222980,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642314841","type":"print"},{"value":"9783642314858","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-31485-8_3","type":"book-chapter","created":{"date-parts":[[2012,6,22]],"date-time":"2012-06-22T15:13:03Z","timestamp":1340377983000},"page":"89-109","source":"Crossref","is-referenced-by-count":16,"title":["A Short Introduction to Implicit Computational Complexity"],"prefix":"10.1007","author":[{"given":"Ugo","family":"Dal Lago","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S. Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, New York (2009)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press (1998)","DOI":"10.1017\/CBO9781139172752"},{"key":"3_CR3","unstructured":"Barendregt, H.P.: The Lambda Calculus \u2013 Its Syntax and Semantics. North-Holland (1984)"},{"key":"3_CR4","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\u00a02, 97\u2013110 (1992)","journal-title":"Computational Complexity"},{"issue":"1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1017\/S0956796800003877","volume":"11","author":"G. Bonfante","year":"2001","unstructured":"Bonfante, G., Cichon, A., Marion, J.-Y., Touzet, H.: Algorithms with polynomial interpretation termination proof. Journal of Functional Programming\u00a011(1), 33\u201353 (2001)","journal-title":"Journal of Functional Programming"},{"issue":"25","key":"3_CR6","doi-asserted-by":"publisher","first-page":"2776","DOI":"10.1016\/j.tcs.2011.02.007","volume":"412","author":"G. Bonfante","year":"2011","unstructured":"Bonfante, G., Marion, J.-Y., Moyen, J.-Y.: Quasi-interpretations a way to control resources. Theoretical Computer Science\u00a0412(25), 2776\u20132796 (2011)","journal-title":"Theoretical Computer Science"},{"key":"3_CR7","unstructured":"Cobham, A.: The intrinsic computational difficulty of functions. In: Bar-Hillel, Y. (ed.) Logic, Methodology and Philosophy of Science, Proceedings of the 1964 International Congress, pp. 24\u201330. North-Holland (1965)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Cutland, N.: Computability: An Introduction to Recursive Function Theory. Cambridge University Press (1980)","DOI":"10.1017\/CBO9781139171496"},{"issue":"2","key":"3_CR9","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":"3_CR10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","volume":"117","author":"J. Hartmanis","year":"1965","unstructured":"Hartmanis, J., Stearns, R.: On the computational complexity of algorithms. Transactions of the American Mathematical Society\u00a0117, 285\u2013306 (1965)","journal-title":"Transactions of the American Mathematical Society"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Hindley, J.R., Seldin, J.P.: Lambda-Calculus and Combinators: An Introduction. Cambridge University Press (2008)","DOI":"10.1017\/CBO9780511809835"},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0890-5401(03)00009-9","volume":"183","author":"M. Hofmann","year":"2003","unstructured":"Hofmann, M.: Linear types and non-size-increasing polynomial time computation. Information and Computation\u00a0183(1), 57\u201385 (2003)","journal-title":"Information and Computation"},{"issue":"1-2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.tcs.2003.10.016","volume":"318","author":"L. Kristiansen","year":"2004","unstructured":"Kristiansen, L., Niggl, K.-H.: On the computational complexity of imperative programming languages. Theoretical Computer Science\u00a0318(1-2), 139\u2013161 (2004)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"3_CR14","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. Theoretical Computer Science\u00a0318(1-2), 163\u2013180 (2004)","journal-title":"Theoretical Computer Science"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Leivant, D.: Stratified functional programs and computational complexity. In: Proceedings of Twentieth Annual Symposium on Principles of Programming Languages, pp. 325\u2013333 (1993)","DOI":"10.1145\/158511.158659"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/BFb0037112","volume-title":"Typed Lambda Calculi and Applications","author":"D. Leivant","year":"1993","unstructured":"Leivant, D., Marion, J.-Y.: Lambda Calculus Characterizations of Poly-Time. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol.\u00a0664, pp. 274\u2013288. Springer, Heidelberg (1993)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/BFb0037112","volume-title":"Typed Lambda Calculi and Applications","author":"D. Leivant","year":"1993","unstructured":"Leivant, D., Marion, J.-Y.: Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol.\u00a0664, pp. 486\u2013500. Springer, Heidelberg (1993)"},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S0890-5401(03)00011-7","volume":"183","author":"J.-Y. Marion","year":"2003","unstructured":"Marion, J.-Y.: Analysing the implicit complexity of programs. Information and Computation\u00a0183(1), 2\u201318 (2003)","journal-title":"Information and Computation"},{"key":"3_CR19","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":"3_CR20","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1993)"},{"key":"3_CR21","unstructured":"Rogers, H.: The Theory of Recursive Functions and Effective Computability. MIT Press (1987)"},{"issue":"3-4","key":"3_CR22","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. Archive for Mathematical Logic\u00a046(3-4), 253\u2013280 (2007)","journal-title":"Archive for Mathematical Logic"},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1112\/plms\/s2-42.1.230","volume":"2","author":"A. Turing","year":"1937","unstructured":"Turing, A.: On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society\u00a02, 230\u2013265 (1937)","journal-title":"Proceedings of the London Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","Lectures on Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31485-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:48:57Z","timestamp":1558298937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31485-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642314841","9783642314858"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31485-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}