{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:59Z","timestamp":1761611159262,"version":"build-2065373602"},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"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":5688,"URL":"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":[[1998]]},"DOI":"10.1016\/s1571-0661(05)82553-8","type":"journal-article","created":{"date-parts":[[2005,5,19]],"date-time":"2005-05-19T09:46:30Z","timestamp":1116495990000},"page":"71-82","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":36,"special_numbering":"C","title":["Reflection in General Logics, Rewriting Logic, and Maude"],"prefix":"10.1016","volume":"15","author":[{"given":"Manuel","family":"Clavel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)82553-8_BIB1","doi-asserted-by":"crossref","unstructured":"P. Borovansk\u00fd, C. Kirchner, H. Kirchner, P.-E. Moreau, and M. Vittek. ELAN: A logical framework based on computational systems. In Meseguer [12], pages 35--50.","DOI":"10.1016\/S1571-0661(04)00032-5"},{"key":"10.1016\/S1571-0661(05)82553-8_BIB2","doi-asserted-by":"crossref","unstructured":"M. Clavel. Reflection in General Logics and in Rewriting Logic with Applications to the Maude Language. PhD thesis, University of Navarre, 1998. To be published by CSLI Publications, Stanford University.","DOI":"10.1016\/S1571-0661(05)82553-8"},{"key":"10.1016\/S1571-0661(05)82553-8_BIB3","doi-asserted-by":"crossref","unstructured":"M. Clavel, S. Eker, P. Lincoln, and J. Meseguer. Principles of Maude. In Meseguer [12], pages 65--89.","DOI":"10.1016\/S1571-0661(04)00034-9"},{"key":"10.1016\/S1571-0661(05)82553-8_BIB4","unstructured":"F. Duran and J. Meseguer. An extensible module algebra for maude. In this volume."},{"year":"1996","series-title":"Proc. Reflection'96","key":"10.1016\/S1571-0661(05)82553-8_BIB5"},{"key":"10.1016\/S1571-0661(05)82553-8_BIB6","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"},{"key":"10.1016\/S1571-0661(05)82553-8_BIB7","series-title":"What is a Logical System?","first-page":"355","article-title":"General logics and logical frameworks","author":"Mart\u00ed-Oliet","year":"1994"},{"key":"10.1016\/S1571-0661(05)82553-8_BIB8","unstructured":"N. Mart\u00ed-Oliet and J. Meseguer. Rewriting logic as a logical and semantic framework. In Meseguer [12], pages 189--224."},{"key":"10.1016\/S1571-0661(05)82553-8_BIB9","series-title":"Logic Colloquium'87","first-page":"275","article-title":"General logics","author":"Meseguer","year":"1989"},{"issue":"1","key":"10.1016\/S1571-0661(05)82553-8_BIB10","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(05)82553-8_BIB11","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(05)82553-8_BIB12","series-title":"volume 4 of Electronic Notes in Theoretical Computer Science. Asilomar","article-title":"First International Workshop on Rewriting Logic","author":"Meseguer","year":"1996"},{"key":"10.1016\/S1571-0661(05)82553-8_BIB13","series-title":"Proc. CONCUR'96, volume 1119 of LNCS","first-page":"331","article-title":"Rewriting logic as a semantic framework for concurrency: a progress report","author":"Meseguer","year":"1996"},{"key":"10.1016\/S1571-0661(05)82553-8_BIB14","article-title":"Formal interoperability","author":"Meseguer","year":"1997","journal-title":"Manuscript, SRI International"},{"key":"10.1016\/S1571-0661(05)82553-8_BIB15","article-title":"Tactics and tacticals in Cambridge LCF","author":"Paulson","year":"1983","journal-title":"Technical Report 39, University of Cambridge"},{"key":"10.1016\/S1571-0661(05)82553-8_BIB16","article-title":"A Maude specification of a reflective object-oriented database model for telecomunication networks","author":"Pita","year":"1998","journal-title":"Manuscript, Universidad Complutense, Madrid"},{"year":"1994","series-title":"Diagonalization and Self-Reference","author":"Smullyan","key":"10.1016\/S1571-0661(05)82553-8_BIB17"},{"key":"10.1016\/S1571-0661(05)82553-8_BIB18","unstructured":"M. Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. PhD thesis, Universit\u00e9 Henry Poincar\u00e9 --- Nancy I, 1994."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825538?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825538?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:08:31Z","timestamp":1761610111000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105825538"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"references-count":18,"alternative-id":["S1571066105825538"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)82553-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Reflection in General Logics, Rewriting Logic, and Maude","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)82553-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}