{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:01:16Z","timestamp":1760079676711},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642389450"},{"type":"electronic","value":"9783642389467"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38946-7_10","type":"book-chapter","created":{"date-parts":[[2013,5,26]],"date-time":"2013-05-26T21:30:38Z","timestamp":1369603838000},"page":"109-124","source":"Crossref","is-referenced-by-count":1,"title":["Bounding Skeletons, Locally Scoped Terms and Exact Bounds for Linear Head Reduction"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Clairambault","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Accattoli, B., Lago, U.D.: On the invariance of the unitary cost model for head reduction. In: Tiwari, A. (ed.) RTA. LIPIcs, vol.\u00a015, pp. 22\u201337. Leibniz-Zentrum fuer Informatik, Schloss Dagstuhl (2012)"},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.2307\/2695106","volume":"66","author":"A. Beckmann","year":"2001","unstructured":"Beckmann, A.: Exact bounds for lengths of reductions in typed lambda-calculus. J. Symb. Log.\u00a066(3), 1277\u20131285 (2001)","journal-title":"J. Symb. Log."},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-19805-2_7","volume-title":"Foundations of Software Science and Computational Structures","author":"A. Bernadet","year":"2011","unstructured":"Bernadet, A., Lengrand, S.: Complexity of strongly normalising \u03bb-terms via non-idempotent intersection types. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol.\u00a06604, pp. 88\u2013107. Springer, Heidelberg (2011)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-19805-2_23","volume-title":"Foundations of Software Science and Computational Structures","author":"P. Clairambault","year":"2011","unstructured":"Clairambault, P.: Estimation of the length of interactions in arena game semantics. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol.\u00a06604, pp. 335\u2013349. Springer, Heidelberg (2011)"},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"325","DOI":"10.2307\/2275524","volume":"60","author":"T. Coquand","year":"1995","unstructured":"Coquand, T.: A semantics of evidence for classical arithmetic. J. Symb. Log.\u00a060(1), 325\u2013337 (1995)","journal-title":"J. Symb. Log."},{"key":"10_CR6","unstructured":"Danos, V., Herbelin, H., Regnier, L.: Game semantics and abstract machines. In: Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science, LICS 1996, pp. 394\u2013405. IEEE (1996)"},{"key":"10_CR7","unstructured":"Danos, V., Regnier, L.: How abstract machines implement head linear reduction (2003) (unpublished)"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0890-5401(03)00010-5","volume":"183","author":"V. Danos","year":"2003","unstructured":"Danos, V., Joinet, J.-B.: Linear logic and elementary time. Inf. Comput.\u00a0183(1), 123\u2013137 (2003)","journal-title":"Inf. Comput."},{"issue":"20","key":"10_CR9","doi-asserted-by":"publisher","first-page":"1884","DOI":"10.1016\/j.tcs.2010.12.017","volume":"412","author":"D. Carvalho de","year":"2011","unstructured":"de Carvalho, D., Pagani, M., de Falco, L.T.: A semantic measure of the execution time in linear logic. TCS\u00a0412(20), 1884\u20131902 (2011)","journal-title":"TCS"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-60178-3_83","volume-title":"Logic and Computational Complexity","author":"J.-Y. Girard","year":"1995","unstructured":"Girard, J.-Y.: Light linear logic. In: Leivant, D. (ed.) LCC 1994. LNCS, vol.\u00a0960, pp. 145\u2013176. Springer, Heidelberg (1995)"},{"issue":"2","key":"10_CR11","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"J.M.E. Hyland","year":"2000","unstructured":"Hyland, J.M.E., Ong, C.-H.L.: On full abstraction for PCF: I, II, and III. Inf. Comput.\u00a0163(2), 285\u2013408 (2000)","journal-title":"Inf. Comput."},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-15975-4_37","volume-title":"Functional Programming Languages and Computer Architecture","author":"T. Johnsson","year":"1985","unstructured":"Johnsson, T.: Lambda lifting: Transforming programs to recursive equations. In: Jouannaud, J.-P. (ed.) FPCA 1985. LNCS, vol.\u00a0201, pp. 190\u2013203. Springer, Heidelberg (1985)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-540-87531-4_18","volume-title":"Computer Science Logic","author":"U. Lago Dal","year":"2008","unstructured":"Dal Lago, U., Laurent, O.: Quantitative game semantics for linear logic. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 230\u2013245. Springer, Heidelberg (2008)"},{"issue":"5","key":"10_CR14","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF01621476","volume":"30","author":"H. Schwichtenberg","year":"1991","unstructured":"Schwichtenberg, H.: An upper bound for reduction sequences in the typed \u03bb-calculus. Archive for Mathematical Logic\u00a030(5), 405\u2013408 (1991)","journal-title":"Archive for Mathematical Logic"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38946-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T03:21:43Z","timestamp":1557717703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38946-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642389450","9783642389467"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38946-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}