{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:54Z","timestamp":1725664974562},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617563"},{"type":"electronic","value":"9783540706540"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61756-6_99","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:20:13Z","timestamp":1330294813000},"page":"393-407","source":"Crossref","is-referenced-by-count":8,"title":["Modeling sharing and recursion for weak reduction strategies using explicit substitution"],"prefix":"10.1007","author":[{"given":"Zine-El-Abidine","family":"Benaissa","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Lescanne","sequence":"additional","affiliation":[]},{"given":"Kristoffer H.","family":"Rose","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Ariola, Z. M., Felleisen, M., Maraist, J., Odersky, M. and Wadler, P. (1995). A call-by-need lambda calculus. 22nd Principles of Programming Languages. San Francisco, California, pp. 233\u2013246.","DOI":"10.1145\/199448.199507"},{"key":"27_CR2","first-page":"416","volume-title":"Logic in Computer Science","author":"Z. M. Ariola","year":"1994","unstructured":"Ariola, Z. M. and Klop, J. W. (1994). Cyclic lambda graph rewriting. Logic in Computer Science. IEEE Computer Society Press. Paris, France. pp. 416\u2013425."},{"key":"27_CR3","unstructured":"Barendregt, H. P. (1984). The Lambda Calculus: Its Syntax and Semantics. Revised edn. North-Holland."},{"key":"27_CR4","unstructured":"Bloo, R. and Rose, K. H. (1995). Preservation of strong normalisation in named lambda calculi with explicit substitution and garbage collection. CSN '95 \u2014 Computer Science in the Netherlands. pp. 62\u201372. \u2329url: ftp:\/\/ftp.diku.dk\/diku\/semantics\/papers\/ D-246.ps\u232a"},{"key":"27_CR5","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0304-3975(91)90230-Y","volume":"82","author":"P.-L. Curien","year":"1991","unstructured":"Curien, P.-L. (1991). An abstract framework for environment machines. Theor. Comp. Sci. 82: 389\u2013402.","journal-title":"Theor. Comp. Sci."},{"key":"27_CR6","unstructured":"Curien, P.-L., Hardin, T. and L\u00e9vy, J.-J. (1992). Confluence properties of weak and strong calculi of explicit substitutions. RR 1617. INRIA. To appear in J.ACM."},{"issue":"5","key":"27_CR7","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"75","author":"N. G. Bruijn de","year":"1972","unstructured":"de Bruijn, N. G. (1972). Lambda calculus with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Proc. Koninkl. Nederl. Akademie van Wetenschappen 75(5): 381\u2013392.","journal-title":"Proc. Koninkl. Nederl. Akademie van Wetenschappen"},{"key":"27_CR8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0304-3975(89)90069-8","volume":"69","author":"M. Felleisen","year":"1989","unstructured":"Felleisen, M. and Friedman, D. P. (1989). A syntactic theory of sequential state. Theor. Comp. Sci. 69: 243\u2013287.","journal-title":"Theor. Comp. Sci."},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Klop, J. W. (1992). Term rewriting systems. In Abramsky, S., Gabbay, D. M. and Maibaum, T. S. E. (eds), Handbook of Logic in Computer Science. Vol. 2. Oxford University Press. pp. 1\u2013116.","DOI":"10.1093\/oso\/9780198537618.003.0001"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Launchbury, J. (1993). A natural semantics for lazy evaluation. 20th Principles of Programming Languages. pp. 144\u2013154.","DOI":"10.1145\/158511.158618"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Maranget, L. (1991). Optimal derivations in weak lambda calculi and in orthogonal rewriting systems. 18th Principles of Programming Languages. pp. 255\u2013268.","DOI":"10.1145\/99583.99618"},{"issue":"2","key":"27_CR12","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1017\/S0956796800000319","volume":"2","author":"S. L. Peyton Jones","year":"1992","unstructured":"Peyton Jones, S. L. (1992). Implementing lazy functional programming languages on stock hardware: the spineless tagless G-machine. Journ. Funct. Progr. 2(2): 127\u2013202.","journal-title":"Journ. Funct. Progr."},{"key":"27_CR13","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G. D. Plotkin","year":"1975","unstructured":"Plotkin, G. D. (1975). Call-by-name, call-by-value, and the \u03bb-calculus. Theor. Comp. Sci. 1: 125\u2013159.","journal-title":"Theor. Comp. Sci."},{"key":"27_CR14","series-title":"DIKU report 96\/1","volume-title":"PhD thesis","author":"K. H. Rose","year":"1996","unstructured":"Rose, K. H. (1996). Operational Reduction Models for Functional Programming Languages. PhD thesis. DIKU, Dept. of Computer Science, Univ. of Copenhagen. Universitetsparken 1, DK-2100 K\u00f8benhavn \u00d8. DIKU report 96\/1."},{"key":"27_CR15","unstructured":"Sestoft, P. (1994). Deriving a lazy abstract machine. Technical Report ID-TR 1994-146. Dept. of Computer Science, Technical University of Denmark. \u2329url: ftp:\/\/ftp.dina.kvl.dk\/pub\/Staff\/Peter.Sestoft\/papers\/amlazy4.dvi.gz\u232a"},{"key":"27_CR16","unstructured":"Wadsworth, C. (1971). Semantics and pragmatics of the lambda calculus. PhD thesis. Oxford."}],"container-title":["Lecture Notes in Computer Science","Programming Languages: Implementations, Logics, and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61756-6_99.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T17:44:54Z","timestamp":1713635094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61756-6_99"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617563","9783540706540"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-61756-6_99","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}