{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:56:16Z","timestamp":1762458976765},"publisher-location":"Berlin, Heidelberg","reference-count":17,"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_100","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:20:38Z","timestamp":1330294838000},"page":"408-422","source":"Crossref","is-referenced-by-count":3,"title":["Context-sensitive computations in confluent programs"],"prefix":"10.1007","author":[{"given":"Salvador","family":"Lucas","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz. Termination of rewriting. Journal on Symbolic Computation 3:69\u2013115, 1987.","journal-title":"Journal on Symbolic Computation"},{"key":"28_CR2","series-title":"volume B: Formal Models and Semantics","first-page":"243","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz and J.P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 243\u2013320. Elsevier, Amsterdam and The MIT Press, Cambridge, MA, 1990."},{"key":"28_CR3","volume-title":"Volume 6 of EATCS Monographs on Theoretical Computer Science","author":"H. Ehrig","year":"1985","unstructured":"H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification. Volume 6 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1985."},{"key":"28_CR4","unstructured":"D.P. Friedman and D.S. Wise. CONS should not evaluate its arguments. In S. Michaelson and R. Milner, editors, Automata, Languages and Programming, pages 257\u2013284, Edinburgh University Press, 1976."},{"key":"28_CR5","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"G. Huet. Confluent reductions: abstract properties and applications to term rewriting systems. Journal of the ACM 27:797\u2013821, 1980.","journal-title":"Journal of the ACM"},{"key":"28_CR6","volume-title":"Computational logic: essays in honour of J. Alan Robinson","author":"G. Huet","year":"1991","unstructured":"G. Huet and J.J. L\u00e9vy. Computations in orthogonal term rewriting systems. In J.L. Lassez and G. Plotkin, editors, Computational logic: essays in honour of J. Alan Robinson, MIT Press, Cambridge, MA, 1991."},{"key":"28_CR7","first-page":"147","volume-title":"LNCS 914","author":"J. Kamperman","year":"1995","unstructured":"J.F.Th. Kamperman and H.R. Walters. Lazy Rewriting and Eager Machinery. In J. Hsiang, editor, Proc. of the 6th International Conference on Rewriting Techniques and Applications, RTA '95, LNCS 914:147\u2013162, Springer-Verlag, Berlin, 1995."},{"key":"28_CR8","unstructured":"R. Lalement. Computation as Logic. Masson-Prentice Hall International, 1993."},{"key":"28_CR9","first-page":"405","volume-title":"LNCS 1012","author":"S. Lucas","year":"1995","unstructured":"S. Lucas. Fundamentals of context-sensitive rewriting. In M. Bartosek, J. Staudek and J. Wiedermann, editors, Proc. of XXII Seminar on Current Trends in Theory and Practice of Informatics, SOFSEM'95, LNCS 1012:405\u2013412, Springer-Verlag, Berlin, 1995."},{"key":"28_CR10","first-page":"122","volume-title":"LNCS 1099","author":"S. Lucas","year":"1996","unstructured":"S. Lucas. Termination of context-sensitive rewriting by rewriting. In F. Meyer auf der Heide and B. Monien, editors, Proc. of 23rd. International Colloquium on Automata, Languages and Programming, ICALP'96, LNCS 1099:122\u2013133, Springer-Verlag, Berlin, 1996."},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"L. Maranget. Optimal Derivations in Weak Lambda-calculi and in Orthogonal Term Rewriting Systems In Conference Record of the 18th ACM Symposium on Principles of Programming Languages, pages 255\u2013269, ACM Press, 1990.","DOI":"10.1145\/99583.99618"},{"key":"28_CR12","first-page":"269","volume-title":"LNCS 83","author":"A. Mycroft","year":"1980","unstructured":"A. Mycroft. The theory and practice of transforming call-by-need into call-by-value. In Proc. of the fourth International Symposium on Programming, LNCS 83:269\u2013281, Springer-Verlag, Berlin, 1980."},{"key":"28_CR13","doi-asserted-by":"crossref","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"M.H.A. Newman","year":"1942","unstructured":"M.H.A. Newman. On theories with a combinatorial definition of \u2018equivalence'. Ann. Math., 43:223\u2013243, 1942.","journal-title":"Ann. Math."},{"key":"28_CR14","unstructured":"C. Reade. Elements of Functional Programming. Addison-Wesley Publishing Company, 1987."},{"key":"28_CR15","volume-title":"Denotational semantics: the Scott-Strachey approach to programming language theory","author":"J.E. Stoy","year":"1977","unstructured":"J.E. Stoy. Denotational semantics: the Scott-Strachey approach to programming language theory. The MIT Press, Cambridge MA, 1977."},{"issue":"3","key":"28_CR16","first-page":"332","volume":"9","author":"J. Vuillemin","year":"1974","unstructured":"J. Vuillemin Correct and optimal implementation of recursion in a simple programming language. JCSS 9(3):332\u2013354, 1974.","journal-title":"JCSS"},{"key":"28_CR17","unstructured":"P. Wadler. Strictness Analysis on Non-Flat Domains (by Abstract Interpretation over Finite Domains). In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, Ellis Horwood Ltd., John Wiley and sons, pages 266\u2013275, 1987."}],"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_100.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:10:15Z","timestamp":1605647415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61756-6_100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617563","9783540706540"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-61756-6_100","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}