{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T11:10:45Z","timestamp":1649070645510},"reference-count":39,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5676,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0304-3975(97)00084-4","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"61-85","source":"Crossref","is-referenced-by-count":0,"title":["Computing in unpredictable environments: semantics, reduction strategies, and program transformations"],"prefix":"10.1016","volume":"190","author":[{"given":"Bj\u00f6rn","family":"Lisper","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00084-4_BIB1","series-title":"Proc. 7th Ann. ACM Symp. on Principles of Programming Languages","first-page":"31","article-title":"Explicit substitutions","author":"Abadi","year":"1990"},{"key":"10.1016\/S0304-3975(97)00084-4_BIB2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(94)00185-L","article-title":"Properties of a first-order functional language with sharing","volume":"146","author":"Ariola","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00084-4_BIB3","series-title":"Concurrent Programming in ERLANG","author":"Armstrong","year":"1993"},{"key":"10.1016\/S0304-3975(97)00084-4_BIB4","series-title":"Algebraic Methods in Semantics","first-page":"1","article-title":"On semantics of nondeterministic recursive program schemes","author":"Arnold","year":"1985"},{"key":"10.1016\/S0304-3975(97)00084-4_BIB5","article-title":"The Lambda Calculus \u2014 Its Syntax and Semantics","volume":"vol. 103","author":"Barendregt","year":"1981"},{"key":"10.1016\/S0304-3975(97)00084-4_BIB6_1","first-page":"149","article-title":"Term graph rewriting","volume":"vol. 2","author":"Barendregt","year":"1987"},{"key":"10.1016\/S0304-3975(97)00084-4_BIB6_2","first-page":"149","article-title":"Term graph rewriting","volume":"vol. 259","author":"Barendregt","year":"1987"},{"key":"10.1016\/S0304-3975(97)00084-4_BIB7","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","article-title":"The chemical abstract machine","volume":"96","author":"Berry","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00084-4_BIB8","first-page":"170","article-title":"Computational semantics of term rewriting systems","author":"Boudol","year":"1985"},{"issue":"1","key":"10.1016\/S0304-3975(97)00084-4_BIB9","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/321992.321996","article-title":"A transformation system for developing recursive programs","volume":"24","author":"Burstall","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(97)00084-4_BIB10","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01744293","article-title":"Infinite trees in normal form and recursive equations having a unique solution","volume":"13","author":"Courcelle","year":"1979","journal-title":"Math. System Theory"},{"key":"10.1016\/S0304-3975(97)00084-4_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(86)90050-2","article-title":"Equivalence and transformations of regular systems","volume":"42","author":"Courcelle","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00084-4_BIB12","first-page":"459","article-title":"Recursive applicative program schemes","author":"Courcelle","year":"1990"},{"issue":"1","key":"10.1016\/S0304-3975(97)00084-4_BIB13","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0304-3975(91)90040-9","article-title":"Rewrite, rewrite, rewrite, rewrite, rewrite,\u2026","volume":"83","author":"Dershowitz","year":"1991","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/S0304-3975(97)00084-4_BIB14","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","article-title":"Initial algebra semantics and continuous algebras","volume":"24","author":"Goguen","year":"1977","journal-title":"J. Assoc. Comput. Math."},{"issue":"4","key":"10.1016\/S0304-3975(97)00084-4_BIB15","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","article-title":"Confluent reductions: abstract properties and applications to term rewriting systems","volume":"27","author":"Huet","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1","key":"10.1016\/S0304-3975(97)00084-4_BIB16","first-page":"31","article-title":"Proving and applying program transformations expressed with second-order patterns","volume":"11","author":"Heut","year":"1978","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(97)00084-4_BIB17","series-title":"Proc. 7th Conf. on Functional Programming Languages and Computer Architecture, ACM Press","article-title":"Making choices lazily","author":"Hughes","year":"1995"},{"key":"10.1016\/S0304-3975(97)00084-4_BIB18","series-title":"Proc. Functional Programming Languages and Computer Architecture","first-page":"190","article-title":"Lambda lifting: transforming programs to recursive equations","volume":"vol. 201","author":"Johnsson","year":"1985"},{"key":"10.1016\/S0304-3975(97)00084-4_BIB19","series-title":"Partial Evaluation and Mixed Computation, Proc. IFIP TC2 Workshop, Gammel Avernas","first-page":"1","article-title":"Challenging problems in partial evaluation and mixed computation","author":"Jones","year":"1988"},{"key":"10.1016\/S0304-3975(97)00084-4_BIB20","series-title":"Partial Evaluation and Automatic Program Generation","author":"Jones","year":"1993"},{"issue":"1","key":"10.1016\/S0304-3975(97)00084-4_BIB21","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1006\/inco.1995.1075","article-title":"Transfinite reductions in orthogonal term rewriting systems","volume":"119","author":"Kennaway","year":"1995","journal-title":"Information and Comput."},{"key":"10.1016\/S0304-3975(97)00084-4_BIB22","series-title":"Mathematical Centre Tracts Nr. 127","article-title":"Combinatory Reduction Systems","author":"Klop","year":"1980"},{"key":"10.1016\/S0304-3975(97)00084-4_BIB23","first-page":"1","article-title":"Term rewriting systems","volume":"vol. 2","author":"Klop","year":"1992"},{"key":"10.1016\/S0304-3975(97)00084-4_BIB24","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(93)90091-7","article-title":"Combinatory reduction systems: introduction and survey","volume":"121","author":"Klop","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00084-4_BIB25","series-title":"Algebraic Methods in Semantics","first-page":"411","article-title":"Unfold\/fold program transformations","author":"Kott","year":"1985"},{"issue":"1","key":"10.1016\/S0304-3975(97)00084-4_BIB26","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(76)90009-8","article-title":"An algebraic interpretation of the \u03bb \u03b2 k-calculus; and an application of a labelled \u03bb-calculus","volume":"2","author":"L\u00e9vy","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00084-4_BIB27","first-page":"255","article-title":"On the interpretation of recursive polyadic program schemes","volume":"15","author":"Nivat","year":"1975"},{"key":"10.1016\/S0304-3975(97)00084-4_BIB28","series-title":"Proc. 23rd Annu. ACM Symp. on Principles of Programming Languages","first-page":"295","article-title":"Concurrent Haskell","author":"Peyton Jones","year":"1996"},{"issue":"1","key":"10.1016\/S0304-3975(97)00084-4_BIB29","first-page":"97","article-title":"Operational and semantic equivalence between recursive programs","volume":"2","author":"Raoult","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(97)00084-4_BIB30","series-title":"Proc. SIGPLAN'91 Conf. on Programming Language Design and Implementation","first-page":"293","article-title":"CML: a higher order concurrent language","author":"Reppy","year":"1991"},{"key":"10.1016\/S0304-3975(97)00084-4_BIB31","series-title":"Proc. 1st Internat. Workshop on Concurrent Constraint Programming","article-title":"Partial evaluation of AKL","author":"Sahlin","year":"1995"},{"issue":"2","key":"10.1016\/S0304-3975(97)00084-4_BIB32","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/227699.227716","article-title":"Total correctness by local improvement in the transformation of functional programs","volume":"18","author":"Sands","year":"1996","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10.1016\/S0304-3975(97)00084-4_BIB33","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/BF00277387","article-title":"Referential transparency, definiteness and unfoldability","volume":"27","author":"S\u00f8ndergaard","year":"1990","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(97)00084-4_BIB34","article-title":"Some Facile Chemistry","author":"Thomsen","year":"1992"},{"key":"10.1016\/S0304-3975(97)00084-4_BIB35","series-title":"Research Topics in Functional Programming","year":"1989"},{"key":"10.1016\/S0304-3975(97)00084-4_BIB36","unstructured":"V. van Oostrom, Private communication."},{"issue":"3","key":"10.1016\/S0304-3975(97)00084-4_BIB37","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/0205036","article-title":"The relation between computational and denotational properties for Scott's d\u221e-models of the lambda calculus","volume":"5","author":"Wadsworth","year":"1976","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/S0304-3975(97)00084-4_BIB38","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1137\/0207028","article-title":"Approximate reduction and lambda calculus models","volume":"7","author":"Wadsworth","year":"1978","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000844?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000844?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:26:06Z","timestamp":1556522766000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597000844"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0304397597000844"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00084-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}