TY - JOUR
T1 - Reflection and Strategies in Rewriting Logic Supported by Office of Naval Research Contracts N00014-95-C-0225 and N00014-96-C-0114, National Science Foundation Grant CCR-9224005, and by the Information Technology Promotion Agency, Japan, as a part of the Industrial Science and Technology Frontier Program "New Models for Software Architecture"
AU - Clavel, Manuel
AU - Mes eguer, José
N1 - Copyright:
Copyright 2014 Elsevier B.V., All rights reserved.
PY - 1996
Y1 - 1996
N2 - After giving general metalogical axioms characterizing reflection in general logics in terms of the notion of a universal theory, this paper specifies a finitely presented universal theory for rewriting logic and gives a detailed proof of the claim made in [5] that rewriting logic is reflective. The paper also gives general axioms for the notion of a strategy language internal to a given logic. Exploiting the fact that rewriting logic is reflexive, a general method for defining internal strategy languages for it and proving their correctness is proposed and is illustrated with an example. The Maude language has been used as an experimental vehicle for the exploration of these techniques. They seem quite promising for applications such as metaprogramming and module composition, logical framework representations, development of formal programming and proving environments, supercompilation, and formal verification of strategies.
AB - After giving general metalogical axioms characterizing reflection in general logics in terms of the notion of a universal theory, this paper specifies a finitely presented universal theory for rewriting logic and gives a detailed proof of the claim made in [5] that rewriting logic is reflective. The paper also gives general axioms for the notion of a strategy language internal to a given logic. Exploiting the fact that rewriting logic is reflexive, a general method for defining internal strategy languages for it and proving their correctness is proposed and is illustrated with an example. The Maude language has been used as an experimental vehicle for the exploration of these techniques. They seem quite promising for applications such as metaprogramming and module composition, logical framework representations, development of formal programming and proving environments, supercompilation, and formal verification of strategies.
UR - http://www.scopus.com/inward/record.url?scp=19144372184&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=19144372184&partnerID=8YFLogxK
U2 - 10.1016/S1571-0661(04)00037-4
DO - 10.1016/S1571-0661(04)00037-4
M3 - Article
AN - SCOPUS:19144372184
SN - 1571-0661
VL - 4
SP - 126
EP - 148
JO - Electronic Notes in Theoretical Computer Science
JF - Electronic Notes in Theoretical Computer Science
IS - C
ER -