{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:32Z","timestamp":1761611072502},"reference-count":23,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"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":8690,"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":[[1989,10]]},"DOI":"10.1016\/0304-3975(89)90006-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"283-301","source":"Crossref","is-referenced-by-count":35,"title":["Term-rewriting systems with rule priorities"],"prefix":"10.1016","volume":"67","author":[{"given":"J.C.M.","family":"Baeten","sequence":"first","affiliation":[]},{"given":"J.A.","family":"Bergstra","sequence":"additional","affiliation":[]},{"given":"J.W.","family":"Klop","sequence":"additional","affiliation":[]},{"given":"W.P.","family":"Weijland","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90006-6_BIB1","doi-asserted-by":"crossref","DOI":"10.1145\/359576.359579","article-title":"Can programming be liberated from the Von Neumann style? A functional style and its algebra programs","volume":"21","author":"Backus","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(89)90006-6_BIB2","series-title":"Report CS-R8407","article-title":"Priority rewrite systems","author":"Baeten","year":"1984"},{"key":"10.1016\/0304-3975(89)90006-6_BIB3","series-title":"Proc. Rewriting Techniques and Applications","first-page":"83","article-title":"Term rewriting systems with priorities","volume":"256","author":"Baeten","year":"1987"},{"key":"10.1016\/0304-3975(89)90006-6_BIB4","first-page":"3","article-title":"A semantics for PROLOG via term rewrite rewrite systems","volume":"308","author":"Baeten","year":"1987"},{"key":"10.1016\/0304-3975(89)90006-6_BIB5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0022-0000(86)90033-4","article-title":"Conditional rewrite rules: confluence and termination","volume":"32","author":"Bergstra","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(89)90006-6_BIB6","series-title":"Proc. ICALP 1982","first-page":"23","article-title":"Algebraic specifications for parametrized data types with minimal parameter and target algebras","volume":"140","author":"Bergstra","year":"1982"},{"key":"10.1016\/0304-3975(89)90006-6_BIB7","first-page":"17","article-title":"Initial algebra specifications for parametrized data types","volume":"19","author":"Bergstra","year":"1983","journal-title":"Elektron. Informationsverarb. Kybernet."},{"key":"10.1016\/0304-3975(89)90006-6_BIB8","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0304-3975(87)90123-X","article-title":"Algebraic specifications of computable and semicomputable data types","volume":"50","author":"Bersgtra","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90006-6_BIB9","series-title":"EATCS Monographs on Theoretical Computer Science","article-title":"Fundamentals of Algebraic Specification 1","author":"Ehrig","year":"1985"},{"key":"10.1016\/0304-3975(89)90006-6_BIB10","article-title":"Principles of OBJ2","author":"Futatsugi","year":"1985","journal-title":"Proc. 12th ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(89)90006-6_BIB11","series-title":"Current Trends in Programming Methods IV, Data Structuring","article-title":"An initial algebra approach to the specification, correctness and implementation of abstract datatypes","author":"Goguen","year":"1978"},{"key":"10.1016\/0304-3975(89)90006-6_BIB12","article-title":"Abstract datatypes as initial algebras and correctness of datatype representations","author":"Goguen","year":"1975","journal-title":"Proc. ACM Conf. on Computer Graphics, Pattern Recognition and Data Structure"},{"key":"10.1016\/0304-3975(89)90006-6_BIB13","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\/0304-3975(89)90006-6_BIB14","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(84)90087-2","article-title":"Conditional rewrite rules","volume":"33","author":"Kaplan","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90006-6_BIB15","series-title":"Algebraische Spezifikation, eine Einf\u00fchrung","author":"Klaeren","year":"1983"},{"key":"10.1016\/0304-3975(89)90006-6_BIB16","article-title":"Combinatory Reduction Systems","volume":"127","author":"Klop","year":"1980","journal-title":"Mathematical Centre Tract"},{"key":"10.1016\/0304-3975(89)90006-6_BIB17","first-page":"143","article-title":"Term rewriting systems: a tutorial","volume":"32","author":"Klop","year":"1987","journal-title":"Bull. EATCS"},{"key":"10.1016\/0304-3975(89)90006-6_BIB18","article-title":"Bibliography on Abstract Datatypes","volume":"68","author":"Kutzler","year":"1983"},{"key":"10.1016\/0304-3975(89)90006-6_BIB19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-08531-9","article-title":"Computing in Systems Described by Equations","author":"O'Donnell","year":"1977"},{"key":"10.1016\/0304-3975(89)90006-6_BIB20","series-title":"Equational Logic as a Programming Language","author":"O'Donnell","year":"1985"},{"key":"10.1016\/0304-3975(89)90006-6_BIB21","series-title":"Forschungsbericht 118\/81","article-title":"Operational semantics of algebraic specifications with conditional equations","author":"Pletat","year":"1981"},{"key":"10.1016\/0304-3975(89)90006-6_BIB22","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","article-title":"A lattice theoretical fixed point theorem and its applications","volume":"5","author":"Tarski","year":"1955","journal-title":"Pacific J. Math."},{"key":"10.1016\/0304-3975(89)90006-6_BIB23","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/7531.7534","article-title":"On the Church-Rosser property of the direct sum of term rewriting systems","volume":"34","author":"Toyama","year":"1987","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900066?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900066?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:56:30Z","timestamp":1555113390000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589900066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":23,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0304397589900066"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90006-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}