{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:21Z","timestamp":1761611121165},"reference-count":26,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":6419,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1996]]},"DOI":"10.1016\/s1571-0661(04)00034-9","type":"journal-article","created":{"date-parts":[[2004,1,29]],"date-time":"2004-01-29T10:14:39Z","timestamp":1075371279000},"page":"65-89","source":"Crossref","is-referenced-by-count":103,"special_numbering":"C","title":["Principles of Maude"],"prefix":"10.1016","volume":"4","author":[{"given":"M.","family":"Clavel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Eker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Lincoln","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Meseguer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00034-9_NEWBIB1","first-page":"76","article-title":"Characterization of computable data types by means of a finite equational specification method","volume":"Volume 81","author":"Bergstra","year":"1980"},{"key":"10.1016\/S1571-0661(04)00034-9_NEWBIB2","unstructured":"P. Borovansk\u00fd, C. Kirchner, and H. Kirchner. Controlling rewriting by rewriting. This volume."},{"key":"10.1016\/S1571-0661(04)00034-9_NEWBIB3","doi-asserted-by":"crossref","unstructured":"Adel Bouhoula, Jean-Pierre Jouannaud, and Jos\u00e9 Meseguer. Specification and proof in membership equational logic. Manuscript, SRI International, August 1996.","DOI":"10.1007\/BFb0030589"},{"key":"10.1016\/S1571-0661(04)00034-9_NEWBIB4","doi-asserted-by":"crossref","unstructured":"Rod Burstall and Joseph Goguen. The semantics of Clear, a specification language. In Dines Bjorner, editor, Proceedings of the 1979 Copenhagen Winter School on Abstract Software Specification, pages 292\u2013332. Springer LNCS 86, 1980.","DOI":"10.1007\/3-540-10007-5_41"},{"key":"10.1016\/S1571-0661(04)00034-9_NEWBIB5","series-title":"Parallel Program Design: A Foundation","author":"Mani","year":"1988"},{"key":"10.1016\/S1571-0661(04)00034-9_NEWBIB6","unstructured":"A. Ciampolini, E. Lamma, P. Mello, and C. Stefanelli. Distributed logic objects: a fragment of rewriting logic and its implementation. This volume."},{"key":"10.1016\/S1571-0661(04)00034-9_NEWBIB7","unstructured":"Manuel G. Clavel and Jos\u00e9 Meseguer. Reflection and strategies in rewriting logic. This volume."},{"key":"10.1016\/S1571-0661(04)00034-9_NEWBIB8","unstructured":"Manuel G. Clavel and Jos\u00e9 Meseguer. Axiomatizing reflective logics and languages. In Gregor Kiczales, editor, Proceedings of Reflection'96, San Francisco, California, April 1996, pages 263\u2013288. Xerox PARC, 1996."},{"key":"10.1016\/S1571-0661(04)00034-9_NEWBIB9","unstructured":"Steven Eker. Fast matching in combination of regular equational theories. This volume."},{"key":"10.1016\/S1571-0661(04)00034-9_NEWBIB10","unstructured":"K. Futatsugi and T. Sawada. Cafe as an extensible specification environment. In Proc. of the Kunming International CASE Symposium, Kunming, China, November, 1994."},{"key":"10.1016\/S1571-0661(04)00034-9_NEWBIB11","unstructured":"J. A. Goguen, T. Winkler, J. Meseguer, K. Futatsugi, and J.-P. Jouannaud. Introducing OBJ3. Technical Report SRI-CSL-92-03, Computer Science Laboratory, SRI International, March 1992."},{"key":"10.1016\/S1571-0661(04)00034-9_NEWBIB12","series-title":"Principles and Practice of Constraint Programming: The Newport Papers","first-page":"133","article-title":"Designing constraint logic programming languages using computational systems","author":"Kirchner","year":"1995"},{"issue":"7","key":"10.1016\/S1571-0661(04)00034-9_NEWBIB13","first-page":"755","article-title":"A relational notation for state transition systems","volume":"SE-16","author":"Simon Lam","year":"1990","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S1571-0661(04)00034-9_NEWBIB14","doi-asserted-by":"crossref","unstructured":"Patrick Lincoln, Narciso Mart\u00ed-Oliet, and Jos\u00e9 Meseguer. Specification, transformation, and programming of concurrent systems in rewriting logic. In G.E. Blelloch, K.M. Chandy, and S. Jagannathan, editors, Specification of Parallel Algorithms, pages 309\u2013339. DIMACS Series, Vol. 18, American Mathematical Society, 1994.","DOI":"10.1090\/dimacs\/018\/20"},{"key":"10.1016\/S1571-0661(04)00034-9_NEWBIB15","unstructured":"Narciso Mart\u00ed-Oliet and Jos\u00e9 Meseguer. Rewriting logic as a logical and semantic framework. Technical Report SRI-CSL-93-05, SRI International, Computer Science Laboratory, August 1993. To appear in D. Gabbay, ed., Handbook of Philosophical Logic, Kluwer Academic Publishers."},{"key":"10.1016\/S1571-0661(04)00034-9_NEWBIB16","unstructured":"Jos\u00e9 Meseguer. Membership algebra. Lecture at the Dagstuhl Seminar on \u201cSpecification and Semantics,\u201d July 9, 1996. Extended version in preparation."},{"key":"10.1016\/S1571-0661(04)00034-9_NEWBIB17","doi-asserted-by":"crossref","unstructured":"Jos\u00e9 Meseguer. A logical theory of concurrent objects. In ECOOP-OOPSLA '90 Conference on Object-Oriented Programming, Ottawa, Canada, October 1990, pages 101\u2013115. ACM, 1990.","DOI":"10.1145\/97945.97958"},{"key":"10.1016\/S1571-0661(04)00034-9_NEWBIB18","doi-asserted-by":"crossref","unstructured":"Jos\u00e9 Meseguer. Rewriting as a unified model of concurrency. Technical Report SRI-CSL-90-02, SRI International, Computer Science Laboratory, February 1990. Revised June 1990.","DOI":"10.1007\/BFb0039072"},{"issue":"1","key":"10.1016\/S1571-0661(04)00034-9_NEWBIB19","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","article-title":"Conditional rewriting logic as a unified model of concurrency","volume":"96","author":"Meseguer","year":"1992","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00034-9_NEWBIB20","series-title":"Research Directions in Concurrent Object-Oriented Programming","first-page":"314","article-title":"A logical theory of concurrent objects and its realization in the Maude language","author":"Meseguer","year":"1993"},{"key":"10.1016\/S1571-0661(04)00034-9_NEWBIB21","doi-asserted-by":"crossref","unstructured":"Jos\u00e9 Meseguer. Solving the inheritance anomaly in concurrent object-oriented programming. In Oscar M. Nierstrasz, editor, Proc. ECOOP'93, pages 220\u2013246. Springer LNCS 707, 1993.","DOI":"10.1007\/3-540-47910-4_13"},{"key":"10.1016\/S1571-0661(04)00034-9_NEWBIB22","doi-asserted-by":"crossref","unstructured":"Jos\u00e9 Meseguer. Rewriting logic as a semantic framework for concurrency: a progress report. In Proceedings of the CONCUR '96 Conference, Pisa, August 1996. Springer LNCS, 1996.","DOI":"10.1007\/3-540-61604-7_64"},{"issue":"1","key":"10.1016\/S1571-0661(04)00034-9_NEWBIB23","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1006\/inco.1993.1016","article-title":"Order-sorted algebra solves the constructor-selector, multiple representation and coercion problems","volume":"103","author":"Meseguer","year":"1993","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)00034-9_NEWBIB24","doi-asserted-by":"crossref","unstructured":"Jos\u00e9 Meseguer and Timothy Winkler. Parallel programming in Maude. In J.-P. Ban\u00e2tre and D. Le M\u00e8tayer, editors, Research Directions in High-level Parallel Programming Languages, pages 253\u2013293. Springer LNCS 574, 1992. Also Technical Report SRI-CSL-91-08, SRI International, Computer Science Laboratory, November 1991.","DOI":"10.1007\/3-540-55160-3_49"},{"key":"10.1016\/S1571-0661(04)00034-9_NEWBIB25","unstructured":"C. L. Talcott. An actor rewrite theory. This volume."},{"key":"10.1016\/S1571-0661(04)00034-9_NEWBIB26","doi-asserted-by":"crossref","unstructured":"P. Viry. Rewriting: An effective model of concurrency. In C. Halatsis et al., editors, PARLE'94, Proc. Sixth Int. Conf. on Parallel Architectures and Languages Europe, Athens, Greece, July 1994, volume 817 of LNCS, pages 648\u2013660. Springer-Verlag, 1994","DOI":"10.1007\/3-540-58184-7_138"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104000349?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104000349?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,29]],"date-time":"2020-03-29T12:32:26Z","timestamp":1585485146000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104000349"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"references-count":26,"alternative-id":["S1571066104000349"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00034-9","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[1996]]}}}