{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T01:44:24Z","timestamp":1726451064097},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":10059,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1986]]},"DOI":"10.1016\/0167-6423(86)90017-1","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T11:44:35Z","timestamp":1048592675000},"page":"11-34","source":"Crossref","is-referenced-by-count":10,"special_numbering":"C","title":["Rewriting systems on FP expressions to reduce the number of sequences yielded"],"prefix":"10.1016","volume":"6","author":[{"given":"Fran\u00e7oise","family":"Bellegarde","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"8","key":"10.1016\/0167-6423(86)90017-1_BIB1","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","article-title":"Can programming be liberated from the Von Neumann style? A functional style and its algebra of programs","volume":"21","author":"Backus","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(86)90017-1_BIB2","series-title":"Proc. International Colloquium on the Formalization of Programming Concepts","first-page":"1","article-title":"The algebra of functional programs: function level reasoning, linear equations","volume":"107","author":"Backus","year":"1981"},{"key":"10.1016\/0167-6423(86)90017-1_BIB3","series-title":"Proc. Conference on Functional Programming Languages and Computer Architecture","first-page":"1","article-title":"Function level programs as mathematical objects","author":"Backus","year":"1981"},{"issue":"3","key":"10.1016\/0167-6423(86)90017-1_BIB4","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","article-title":"Orderings for term-rewriting systems","volume":"17","author":"Dershowitz","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-6423(86)90017-1_BIB5","series-title":"Proc. Conference on Specifications of Reliable Software","article-title":"An introduction to OBJ: a language for writing and testing formal algebraic program specifications","author":"Goguen","year":"1979"},{"key":"10.1016\/0167-6423(86)90017-1_BIB6","series-title":"Proc. 5th Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages","article-title":"A metalanguage for interactive proof in LCF","author":"Gordon","year":"1978"},{"key":"10.1016\/0167-6423(86)90017-1_BIB7","series-title":"Proc. 5th POPL","first-page":"1","article-title":"Compilation and delayed evaluation in APL","author":"Guibas","year":"1978"},{"issue":"4","key":"10.1016\/0167-6423(86)90017-1_BIB8","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. ACM"},{"key":"10.1016\/0167-6423(86)90017-1_BIB9","series-title":"Formal Languages: Perspectives and Open Problems","first-page":"349","article-title":"Equations and rewrite rules: a survey","author":"Huet","year":"1980"},{"key":"10.1016\/0167-6423(86)90017-1_BIB10","first-page":"269","article-title":"Confluent and coherent equational term rewriting systems. Application to proofs in abstract data type","author":"Jouannaud","year":"1983","journal-title":"CAAP, l'Aquila"},{"key":"10.1016\/0167-6423(86)90017-1_BIB11","series-title":"Proc 11th POPL","first-page":"83","article-title":"Completion of a set of rules modulo a set of equations","author":"Jouannaud","year":"1984"},{"key":"10.1016\/0167-6423(86)90017-1_BIB12","series-title":"Proc. 10th ICALP","first-page":"661","article-title":"Incremental construction of unification algorithms in equational theories","volume":"154","author":"Jouannaud","year":"1983"},{"key":"10.1016\/0167-6423(86)90017-1_BIB13","unstructured":"J.P. Jouannaud, C. Kirchner and H. Kirchner, Using metal-rules in the Knuth-Bendix completion algorithm, to appear."},{"key":"10.1016\/0167-6423(86)90017-1_BIB14","series-title":"Formal Description of Program Concept II, IFIP TC-2 Conference","article-title":"Recursive decomposition ordering","author":"Jouannaud","year":"1982"},{"key":"10.1016\/0167-6423(86)90017-1_BIB15","article-title":"Unification dans les theories equationnelles","author":"Kirchner","year":"1983","journal-title":"Internal Report, CRIN 83R011"},{"key":"10.1016\/0167-6423(86)90017-1_BIB16","series-title":"Computational Problem in Universal Algebra","first-page":"263","article-title":"Simple word problems in universal algebras","author":"Knuth","year":"1970"},{"article-title":"On proving term-rewriting systems are noetherian","year":"1979","author":"Lankford","key":"10.1016\/0167-6423(86)90017-1_BIB17"},{"key":"10.1016\/0167-6423(86)90017-1_BIB18","series-title":"Proc. 10th POPL","first-page":"99","article-title":"Computer experiments with the REVE term rewriting system generator","author":"Lescanne","year":"1983"},{"key":"10.1016\/0167-6423(86)90017-1_BIB19","article-title":"Uniform termination of term-rewriting systems, a new recursive decomposition ordering and its implementation","author":"Lescanne","year":"1983","journal-title":"Internal Report, CRIN"},{"key":"10.1016\/0167-6423(86)90017-1_BIB20","series-title":"Proc. 3rd International Conference on System Sciences","first-page":"789","article-title":"On the termination of Markov algorithms","author":"Manna","year":"1970"},{"key":"10.1016\/0167-6423(86)90017-1_BIB21","series-title":"Proc. 9th IJCAI","first-page":"10","article-title":"Theory of linear equations applied to program transformation","author":"Reddy","year":"1983"},{"journal-title":"SASL language manual, St. Andrews University Technical Report","year":"1976","author":"Turner","key":"10.1016\/0167-6423(86)90017-1_BIB22"},{"key":"10.1016\/0167-6423(86)90017-1_BIB23","series-title":"Proc. Conference on Functional Programming Languages and Computer Architecture","first-page":"25","article-title":"Applicative style of programming, program transformation and list operators","author":"Wadler","year":"1981"},{"key":"10.1016\/0167-6423(86)90017-1_BIB24","doi-asserted-by":"crossref","DOI":"10.1145\/69622.357193","article-title":"On the development of the algebra of functional programs","author":"Williams","year":"1980"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642386900171?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642386900171?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T11:50:18Z","timestamp":1553428218000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642386900171"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":24,"alternative-id":["0167642386900171"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(86)90017-1","relation":{},"ISSN":["0167-6423"],"issn-type":[{"type":"print","value":"0167-6423"}],"subject":[],"published":{"date-parts":[[1986]]}}}