{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T08:39:21Z","timestamp":1787560761279,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540354666","type":"print"},{"value":"9783540354680","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11780342_11","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T02:19:46Z","timestamp":1151461186000},"page":"105-114","source":"Crossref","is-referenced-by-count":12,"title":["An Invariant Cost Model for the Lambda Calculus"],"prefix":"10.1007","author":[{"given":"Ugo","family":"Dal Lago","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simone","family":"Martini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Asperti, A.: On the complexity of beta-reduction. In: Proc. 23rd ACM SIGPLAN Symposium on Principles of Programming Languages, pp. 110\u2013118 (1996)","DOI":"10.1145\/237721.237742"},{"key":"11_CR2","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"The Optimal Implementation of Functional Programming Languages","author":"A. Asperti","year":"1998","unstructured":"Asperti, A., Guerrini, S.: The Optimal Implementation of Functional Programming Languages. Cambridge Tracts in Theoretical Computer Science, vol.\u00a045. Cambridge University Press, Cambridge (1998)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/11590156_15","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"U. Lago Dal","year":"2005","unstructured":"Dal Lago, U., Hofmann, M.: Quantitative models and implicit complexity. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 189\u2013200. Springer, Heidelberg (2005)"},{"key":"11_CR4","unstructured":"Dal Lago, U., Martini, S.: An invariant cost model for the lambda calculus (2005) (extended Version) Available at: \n                  \n                    http:\/\/arxiv.org\/cs.LO\/0511045"},{"issue":"5","key":"11_CR5","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"34","author":"N.G. Bruijn de","year":"1972","unstructured":"de Bruijn, N.G.: Lambda calculus with nameless dummies, a tool for automatic formula manipulation, with application to the church-rosser theorem. Indagationes Mathematicae\u00a034(5), 381\u2013392 (1972)","journal-title":"Indagationes Mathematicae"},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1051\/ita\/1979130302571","volume":"13","author":"M. Dezani-Ciancaglini","year":"1979","unstructured":"Dezani-Ciancaglini, M., della Rocca, S.R., Saitta, L.: Complexity of lambda-terms reductions. RAIRO Informatique Theorique\u00a013(3), 257\u2013287 (1979)","journal-title":"RAIRO Informatique Theorique"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Frandsen, G.S., Sturtivant, C.: What is an efficient implementation of the lambda-calculus? In: Proc. 5th ACM Conference on Functional Programming Languages and Computer Architecture, pp. 289\u2013312 (1991)","DOI":"10.1007\/3540543961_14"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Lamping, J.: An algorithm for optimal lambda calculus reduction. In: Proc. 17th ACM SIGPLAN Symposium on Principles of Programming Languages, pp. 16\u201330 (1990)","DOI":"10.1145\/96709.96711"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Lawall, J.L., Mairson, H.G.: Optimality and inefficiency: What isn\u2019t a cost model of the lambda calculus? In: Proc. 1996 ACM SIGPLAN International Conference on Functional Programming, pp. 92\u2013101 (1996)","DOI":"10.1145\/232627.232639"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Lawall, J.L., Mairson, H.G.: On global dynamics of optimal graph reduction. In: Proc. 1997 ACM SIGPLAN International Conference on Functional Programming, pp. 188\u2013195 (1997)","DOI":"10.1145\/258948.258966"},{"key":"11_CR11","unstructured":"L\u00e9vy, J.-J.: R\u00e9ductions corrected et optimales dans le lambda-calcul. Universit\u00e9 Paris 7, Th\u00e8ses d\u2019Etat (1978)"},{"key":"11_CR12","series-title":"Texts in Theoretical Computer Science: An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-10394-4","volume-title":"The parametric lambda-calculus","author":"S.R. Rocca Della","year":"2004","unstructured":"Della Rocca, S.R., Paolini, L.: The parametric lambda-calculus. Texts in Theoretical Computer Science: An EATCS Series. Springer, Heidelberg (2004)"},{"key":"11_CR13","series-title":"Algorithms and Complexity (A)","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 (A), vol.\u00a0A, pp. 1\u201366. MIT Press, Cambridge (1990)"},{"key":"11_CR14","volume-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"C. Wadsworth","year":"1980","unstructured":"Wadsworth, C.: Some unusual \u03bb-calculus numeral systems. In: Seldin, J.P., Hindley, J.R. (eds.) To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism. Academic Press, London (1980)"}],"container-title":["Lecture Notes in Computer Science","Logical Approaches to Computational Barriers"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780342_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T23:08:32Z","timestamp":1552345712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780342_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354666","9783540354680"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11780342_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}