{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T09:31:05Z","timestamp":1742635865616},"publisher-location":"London","reference-count":6,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540198208"},{"type":"electronic","value":"9781447132158"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/978-1-4471-3215-8_13","type":"book-chapter","created":{"date-parts":[[2011,12,17]],"date-time":"2011-12-17T10:34:20Z","timestamp":1324118060000},"page":"144-153","source":"Crossref","is-referenced-by-count":3,"title":["Avoiding Unnecessary Updates"],"prefix":"10.1007","author":[{"given":"John","family":"Launchbury","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andy","family":"Gill","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Hughes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Marlow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Peyton Jones","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip","family":"Wadler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Girard, Scedrov, and Scott, Bounded Linear Logic, J of Theoretical Computer Science, 97: 1\u201366, 1992.","DOI":"10.1016\/0304-3975(92)90386-T"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"J. Fairbairn and S. Wray, A Simple Lazy Abstract-Machine to Execute Supercombinators, in Proc. FPCA, Portland, pp 34\u201345, S-V, 1987.","DOI":"10.1007\/3-540-18317-5_3"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"J. Launchbury, A Natural Semantics for Lazy Evaluation, in Proc. ACM SIGPLAN Principles of Programming Languages, Charleston, South Carolina, 1993.","DOI":"10.1145\/158511.158618"},{"key":"13_CR4","unstructured":"J.-J. L\u00e9vy, Optimal Reductions in the Lambda Calculus, in Seldin and Hind-ley eds., To H.B.Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism, pp 159\u2013191, Academic Press, 1980."},{"key":"13_CR5","first-page":"98","volume":"274","author":"SJ Peyton","year":"1987","unstructured":"S. Peyton Jones, C. Clack, J.Salkild, M. Hardie, GRIP\u2013a high-performance architecture for parallel graph reduction. Proc IFIP conference on Functional Programming Languages and Computer Architecture, Portland. Springer Verlag LNCS 274, pp 98\u2013112, 1987.","journal-title":"Springer Verlag LNCS"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"S. Peyton Jones, Implementing Lazy Functional Languages on Stock Hardware: the Spineless Tagless G-Machine,Journal of Functional Programming, CUP, 1992, to appear.","DOI":"10.1017\/S0956796800000319"}],"container-title":["Workshops in Computing","Functional Programming, Glasgow 1992"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-3215-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T01:46:02Z","timestamp":1561081562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-3215-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540198208","9781447132158"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-3215-8_13","relation":{},"ISSN":["1431-1682"],"issn-type":[{"type":"print","value":"1431-1682"}],"subject":[],"published":{"date-parts":[[1993]]}}}