{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:54:38Z","timestamp":1725551678910},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309116"},{"type":"electronic","value":"9783540324256"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11601548_7","type":"book-chapter","created":{"date-parts":[[2005,12,10]],"date-time":"2005-12-10T05:39:45Z","timestamp":1134193185000},"page":"70-87","source":"Crossref","is-referenced-by-count":4,"title":["Sharing in the Weak Lambda-Calculus"],"prefix":"10.1007","author":[{"given":"Tomasz","family":"Blanc","sequence":"first","affiliation":[]},{"given":"Jean-Jacques","family":"L\u00e9vy","sequence":"additional","affiliation":[]},{"given":"Luc","family":"Maranget","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1017\/S0956796800001696","volume":"6","author":"M. Abadi","year":"1996","unstructured":"Abadi, M., Cardelli, L., Curien, P.-L., L\u00e9vy, J.-J.: Explicit substitutions. Journal of Functional Programming\u00a06(2), 299\u2013327 (1996)","journal-title":"Journal of Functional Programming"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Ariola, Z.M., Felleisen, M., Maraist, J., Odersky, M., Wadler, P.: A call-by-need lambda calculus. In: Proc. 22nd ACM Symposium on Principles of Programming Languages, January 1995, pp. 233\u2013246 (1995)","DOI":"10.1145\/199448.199507"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ic.2004.05.001","volume":"193\/1","author":"A. Asperti","year":"2004","unstructured":"Asperti, A., Coppola, P., Martini, S. (Optimal) duplication is not elementary recursive. Information and Computation\u00a0193\/1, 21\u201356 (2004)","journal-title":"Information and Computation"},{"key":"7_CR4","volume-title":"The Optimal Implementation of Functional Programming Languages","author":"A. Asperti","year":"1999","unstructured":"Asperti, A., Guerrini, S.: The Optimal Implementation of Functional Programming Languages. Cambridge University Press, Cambridge (1999)"},{"key":"7_CR5","volume-title":"The Lambda Calculus, Its Syntax and Semantics","author":"H.P. Barendregt","year":"1981","unstructured":"Barendregt, H.P.: The Lambda Calculus, Its Syntax and Semantics. North-Holland, Amsterdam (1981)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0304-3975(97)00250-8","volume":"198","author":"N. \u00c7a\u011fman","year":"1998","unstructured":"\u00c7a\u011fman, N., Hindley, J.R\u0303.: Combinatory weak reduction in lambda calculus. Theoretical Computer Science\u00a0198, 239\u2013249 (1998)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1145\/226643.226675","volume":"43","author":"P.-L. Curien","year":"1996","unstructured":"Curien, P.-L., Hardin, T., L\u00e9vy, J.-J.: Confluence properties of weak and strong calculi of explicit substitutions. Journal of the ACM\u00a043(2), 362\u2013397 (1996)","journal-title":"Journal of the ACM"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/3-540-48168-0_16","volume-title":"Computer Science Logic","author":"M. Fern\u00e1ndez","year":"1999","unstructured":"Fern\u00e1ndez, M., Mackie, I.: Closed reductions in the lambda-calculus. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 220\u2013234. Springer, Heidelberg (1999)"},{"key":"7_CR9","first-page":"15","volume-title":"Proc. of the 19th Conference on Principles of Programming Languages","author":"G. Gonthier","year":"1992","unstructured":"Gonthier, G., Abadi, M., L\u00e9vy, J.-J.: The geometry of optimal lambda reduction. In: Proc. of the 19th Conference on Principles of Programming Languages, pp. 15\u201326. ACM Press, New York (1992)"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1002\/malq.19770230708","volume":"23","author":"J. R\u0303oger Hindley","year":"1977","unstructured":"R\u0303oger Hindley, J.: Combinatory reductions and lambda reductions compared. Zeit. Math. Logik\u00a023, 169\u2013180 (1977)","journal-title":"Zeit. Math. Logik"},{"key":"7_CR11","unstructured":"Klop, J.W.: Combinatory Reduction Systems. PhD thesis, Rijksuniversiteit Utrecht (1980)"},{"key":"7_CR12","first-page":"95","volume-title":"Principles of Programming Languages","author":"Y. Lafont","year":"1990","unstructured":"Lafont, Y.: Interaction nets. In: Principles of Programming Languages, pp. 95\u2013108. ACM Press, New York (1990)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Lamping, J.: An algorithm for optimal lambda-calculus reduction. In: Proceedings of the 17th Annual ACM Symposium on Principles of Programming Languages, pp. 16\u201330 (1990)","DOI":"10.1145\/96709.96711"},{"key":"7_CR14","first-page":"144","volume-title":"Proc. of the 1993 conference on Principles of Programming Languages","author":"J. Launchbury","year":"1993","unstructured":"Launchbury, J.: A natural semantics for lazy evaluation. In: Proc. of the 1993 conference on Principles of Programming Languages, pp. 144\u2013154. ACM Press, New York (1993)"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Lawall, J.L., Mairson, H.G.: On the global dynamics of optimal graph reduction. In: ACM International Conference on Functional Programming, pp. 188\u2013195 (1997)","DOI":"10.1145\/258948.258966"},{"key":"7_CR16","unstructured":"Leroy, X.: The ZINC experiment: an economical implementation of the ML language. Technical report 117, INRIA (1990)"},{"key":"7_CR17","unstructured":"L\u00e9vy, J.-J.: R\u00e9ductions correctes et optimales dans le lambda-calcul. PhD thesis, Univ. of Paris 7, Paris (1978)"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-46691-6_14","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"J.-J. L\u00e9vy","year":"1999","unstructured":"L\u00e9vy, J.-J., Maranget, L.: Explicit substitutions and programming languages. In: Pandu Rangan, C., Raman, V., Sarukkai, S. (eds.) FST TCS 1999. LNCS, vol.\u00a01738, pp. 181\u2013200. Springer, Heidelberg (1999)"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Maraist, J., Odersky, M., Turner, D.N., Wadler, P.: Call-by-name, call-by-value, call-by-need, and the linear lambda calculus. In: Electronic Notes in Theoretical Computer Science, March 1995, pp. 41\u201362 (1995)","DOI":"10.1016\/S1571-0661(04)00022-2"},{"key":"7_CR20","unstructured":"Maranget, L.: La strat\u00e9gie paresseuse. PhD thesis, Univ. of Paris 7, Paris (1992)"},{"key":"7_CR21","unstructured":"Melli\u00e8s, P.-A.: Description Abstraite des Syst\u00e8mes de R\u00e9\u00e9criture. PhD thesis, Univ. of Paris 7, december (1996)"},{"key":"7_CR22","volume-title":"The implementation of Functional Programming Languages","author":"S.L. Peyton-Jones","year":"1987","unstructured":"Peyton-Jones, S.L.: The implementation of Functional Programming Languages. Prentice-Hall, Englewood Cliffs (1987)"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Shivers, O., Wand, M.: Bottom-up beta-substitution: uplinks and lambda-dags. Technical report, BRICS RS-04-38, DAIMI, Department of Computer Science, University of \u00c5rhus, \u00c5rhus, Denmark (2004)","DOI":"10.7146\/brics.v11i38.21863"},{"key":"7_CR24","volume-title":"Term Rewriting Systems","author":"Terese","year":"2003","unstructured":"Terese: Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"},{"key":"7_CR25","unstructured":"Wadsworth, C.P.: Semantics and pragmatics of the lambda-calculus. PhD thesis, Oxford University (1971)"}],"container-title":["Lecture Notes in Computer Science","Processes, Terms and Cycles: Steps on the Road to Infinity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11601548_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:26:00Z","timestamp":1586611560000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11601548_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309116","9783540324256"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11601548_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}