{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T20:15:19Z","timestamp":1775592919610,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"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_20","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T02:19:46Z","timestamp":1151461186000},"page":"186-197","source":"Crossref","is-referenced-by-count":31,"title":["B\u00f6hm Trees, Krivine\u2019s Machine and the Taylor Expansion of Lambda-Terms"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Ehrhard","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Regnier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1\u20133","key":"20_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(03)00392-X","volume":"309","author":"T. Ehrhard","year":"2003","unstructured":"Ehrhard, T., Regnier, L.: The differential lambda-calculus. Theoretical Computer Science\u00a0309(1\u20133), 1\u201341 (2003)","journal-title":"Theoretical Computer Science"},{"key":"20_CR2","unstructured":"Ehrhard, T., Regnier, L.: Uniformity and the Taylor expansion of ordinary lambda-terms. Technical report, Institut de math\u00e9matiques de Luminy (2005) Theoretical Computer Science (submitted)"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Boudol, G.: The lambda calculus with multiplicities. Technical Report 2025, INRIA Sophia-Antipolis (1993)","DOI":"10.1007\/3-540-57208-2_1"},{"issue":"4","key":"20_CR4","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1017\/S0960129599002893","volume":"9","author":"G. Boudol","year":"1999","unstructured":"Boudol, G., Curien, P.-L., Lavatelli, C.: A semantics for lambda calculi with resource. Mathematical Structures in Computer Science\u00a09(4), 437\u2013482 (1999)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"3","key":"20_CR5","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1093\/logcom\/10.3.411","volume":"10","author":"A.J. Kfoury","year":"2000","unstructured":"Kfoury, A.J.: A linearization of the lambda-calculus. Journal of Logic and Computation\u00a010(3), 411\u2013436 (2000)","journal-title":"Journal of Logic and Computation"},{"key":"20_CR6","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"35","volume-title":"Proceedings of WoLLIC 2004","author":"T. Ehrhard","year":"2004","unstructured":"Ehrhard, T., Regnier, L.: Differential interaction nets. In: Proceedings of WoLLIC 2004. Electronic Notes in Theoretical Computer Science, vol.\u00a0103, pp. 35\u201374. Elsevier Science, Amsterdam (2004)"},{"key":"20_CR7","unstructured":"Krivine, J.-L.: A call-by-name lambda-calculus machine. Higher-Order and Symbolic Computation (to appear, 2005)"},{"key":"#cr-split#-20_CR8.1","unstructured":"De Bruijn, N.: Generalizing Automath by means of a lambda-typed lambda calculus. In: Kueker, D.W., Lopez-Escobar, E.G.K., Smith, C.H. (eds.) Mathematical Logic and Theoretical Computer Science. Lecture Notes in Pure and Applied Mathematics, pp. 71???92. Marcel Dekker (1987);"},{"key":"#cr-split#-20_CR8.2","unstructured":"Reprinted in: Selected papers on Automath, Studies in Logic, vol. 133, pp. 313???337. North-Holland (1994)"},{"issue":"1\u20132","key":"20_CR9","first-page":"273","volume":"227","author":"V. Danos","year":"1999","unstructured":"Danos, V., Regnier, L.: Reversible, irreversible and optimal lambda-machines. Theoretical Computer Science\u00a0227(1\u20132), 273\u2013291 (1999)","journal-title":"Theoretical Computer Science"},{"key":"20_CR10","unstructured":"Vaux, L.: The differential lambda-mu calculus. Technical report, Institut de Math\u00e9matiques de Luminy (submitted for publication, 2005)"}],"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_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T13:00:39Z","timestamp":1555678839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780342_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354666","9783540354680"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11780342_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}