{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:15Z","timestamp":1761610335918,"version":"build-2065373602"},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":6784,"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1995]]},"DOI":"10.1016\/s1571-0661(05)80193-8","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"167-176","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"special_numbering":"C","title":["Context-sensitive Conditional Expression Reduction Systems"],"prefix":"10.1016","volume":"2","author":[{"given":"Zurab","family":"Khasidashvili","sequence":"first","affiliation":[]},{"given":"Vincent","family":"van Oostrom","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"doi-asserted-by":"crossref","unstructured":"Akama Y. On Mints' reduction for ccc-calculus. In: Proc. of the 1st International conference on Typed Lambda Calculus and Applications, TLCA'93, LNCS, vol. 664, Bezem M., Groote J.F., eds., 1993, p. 1\u201312.","key":"10.1016\/S1571-0661(05)80193-8_BIB1","DOI":"10.1007\/BFb0037094"},{"doi-asserted-by":"crossref","unstructured":"Ariola Z.M., Felleisen M., Maraist J., Odersky M., Wadler P. A Call-By-Need Lambda Calculus. In: Proc. ACM Conference on Principles of Programming Languages, 1995.","key":"10.1016\/S1571-0661(05)80193-8_BIB2","DOI":"10.1145\/199448.199507"},{"doi-asserted-by":"crossref","unstructured":"Baeten J.C.M., Bergstra J.A., Klop J.W., Weijland W.P. Term Rewriting Systems with rule priorities. Journal of TCS 67, 1989, p. 283\u2013301.","key":"10.1016\/S1571-0661(05)80193-8_BIB3","DOI":"10.1016\/0304-3975(89)90006-6"},{"key":"10.1016\/S1571-0661(05)80193-8_BIB4","article-title":"The Lambda Calculus, its Syntax and Semantics","author":"Barendregt","year":"1984","journal-title":"North-Holland"},{"doi-asserted-by":"crossref","unstructured":"Bergstra J. A., Klop J. W. Conditional Rewrite Rules: confluence and termination. JCSS vol. 32, n. 3, 1986, p. 323\u2013362.","key":"10.1016\/S1571-0661(05)80193-8_BIB5","DOI":"10.1016\/0022-0000(86)90033-4"},{"doi-asserted-by":"crossref","unstructured":"Dershowitz N., Okada M., Sivakumar G. Canonical conditional rewrite systems. In: Proc. of the 9th International Conference on Automated Deduction, LNCS, vol. 310, p. 538\u2013549.","key":"10.1016\/S1571-0661(05)80193-8_BIB6","DOI":"10.1007\/BFb0012855"},{"key":"10.1016\/S1571-0661(05)80193-8_BIB7","article-title":"The Church-Rosser theorem in Orthogonal Combinatory Reduction Systems","author":"Khasidashvili","year":"1992","journal-title":"Report 1825, INRIA Rocquencourt"},{"doi-asserted-by":"crossref","unstructured":"Khasidashvili Z. The longest perpetual reductions in orthogonal expression reduction systems. In: Proc. of the 3rd International Conference on Logical Foundations of Computer Science, LFCS'94, LNCS, vol. 813, Nerode A., Matiyasevich Yu. V. eds. St. Petersburg, 1994. p. 191\u2013203.","key":"10.1016\/S1571-0661(05)80193-8_BIB8","DOI":"10.1007\/3-540-58140-5_20"},{"key":"10.1016\/S1571-0661(05)80193-8_BIB9","article-title":"Context-sensitive Conditional Rewrite Systems","author":"Khasidashvili","year":"1995","journal-title":"Report SYS-C95-06. University of East Anglia"},{"key":"10.1016\/S1571-0661(05)80193-8_BIB10","article-title":"Combinatory Reduction Systems","author":"Klop","year":"1980","journal-title":"Mathematical Centre Tracts 127. Centre for Mathematics and Computer Science, Amsterdam"},{"key":"10.1016\/S1571-0661(05)80193-8_BIB11","article-title":"Term Rewriting Systems","author":"Klop","year":"1990","journal-title":"Report CS-R9073, Centre for Mathematics and Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Klop J. W., van Oostrom V., van Raamsdonk F. Combinatory reduction systems: introduction and survey. In: To Corrado B\u00f6hm, J. of Theoretical Computer Science 121, 1993, p. 279\u2013308.","key":"10.1016\/S1571-0661(05)80193-8_BIB12","DOI":"10.1016\/0304-3975(93)90091-7"},{"unstructured":"Melli\u00e8s P.-A. An abstract theorem of finite developments. Talk presented at CONFER-meeting, September 1993, Amsterdam.","key":"10.1016\/S1571-0661(05)80193-8_BIB13"},{"doi-asserted-by":"crossref","unstructured":"Meseguer J. Conditional Rewriting Logic as a unified model of concurrency. Journal of TCS 96, 1992, p. 73\u2013155.","key":"10.1016\/S1571-0661(05)80193-8_BIB14","DOI":"10.1016\/0304-3975(92)90182-F"},{"issue":"2","key":"10.1016\/S1571-0661(05)80193-8_BIB15","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1017\/S0960129500001407","article-title":"Functions as processes","volume":"2","author":"Milner","year":"1992","journal-title":"Journal of Mathematical structures in Computer Science"},{"unstructured":"Nederpelt R.P. Strong normalization for a typed lambda-calculus with lambda structured types. Ph.D. Thesis, Eindhoven, 1973.","key":"10.1016\/S1571-0661(05)80193-8_BIB16"},{"doi-asserted-by":"crossref","unstructured":"Nipkow T. Orthogonal higher-order rewrite systems are confluent. In: Proc. of the 1st International conference on Typed Lambda Calculus and Applications, TLCA'93, LNCS, vol. 664, Bezem M., Groote J.F., eds., 1993, p. 306\u2013317.","key":"10.1016\/S1571-0661(05)80193-8_BIB17","DOI":"10.1007\/BFb0037114"},{"unstructured":"Van Oostrom V. Confluence for Abstract and Higher-Order Rewriting. Ph. D. Thesis, Free University of Amsterdam, 1994.","key":"10.1016\/S1571-0661(05)80193-8_BIB18"},{"doi-asserted-by":"crossref","unstructured":"Van Oostrom V., van Raamsdonk F. Weak orthogonality implies confluence: the higher-order case. In: Proc. of the 3rd International Symposium on Logical Foundations of Computer Science, LFCS'94, LNCS, vol. 813, Nerode A., Matiyasevich Yu. V., eds. St. Petersburg, 1994, p. 379\u2013392.","key":"10.1016\/S1571-0661(05)80193-8_BIB19","DOI":"10.1007\/3-540-58140-5_35"},{"doi-asserted-by":"crossref","unstructured":"Van Raamsdonk F. Confluence and superdevelopments. In: Proc. of the 5th International Conference on Rewriting Techniques and Applications, RTA'93, LNCS, vol. 690, C. Kirchner, ed. Montreal, 1993, p. 168\u2013182.","key":"10.1016\/S1571-0661(05)80193-8_BIB20","DOI":"10.1007\/978-3-662-21551-7_14"},{"doi-asserted-by":"crossref","unstructured":"Takahashi M. \u03bb-Calculi with Conditional Rules. In: Proc. of the 1st International conference on Typed Lambda Calculus and Applications, TLCA'93, LNCS, vol. 664, Bezem M., Groote J.F., eds., 1993, p. 406\u2013417.","key":"10.1016\/S1571-0661(05)80193-8_BIB21","DOI":"10.1007\/BFb0037121"},{"doi-asserted-by":"crossref","unstructured":"Toyama Y. Confluent term rewriting systems with membership conditions. In: Proc. of the 1st International Workshop on Conditional Term Rewriting Systems, LNCS, vol. 308, 1988, p. 128\u2013141.","key":"10.1016\/S1571-0661(05)80193-8_BIB22","DOI":"10.1007\/3-540-19242-5_17"},{"key":"10.1016\/S1571-0661(05)80193-8_BIB23","article-title":"The clausal theory of types","volume":"vol. 21","author":"Wolfram","year":"1993"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1571066105801938?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1571066105801938?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:07:31Z","timestamp":1761610051000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105801938"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":23,"alternative-id":["S1571066105801938"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/s1571-0661(05)80193-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Context-sensitive Conditional Expression Reduction Systems","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/S1571-0661(05)80193-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1995 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}