Reflection in Membership Equational Logic, Many-Sorted Equational Logic, Horn Logic with Equality, and Rewriting Logic

https://doi.org/10.1016/S1571-0661(05)82531-9Get rights and content
Under a Creative Commons license
open access

Abstract

We show that the generalized variant of rewriting logic where the underlying equational specifications are membership equational theories, and where the rules are conditional and can have equations, memberships and rewrites in the conditions is reflective. We also show that membership equational logic, many-sorted equational logic, and Horn logic with equality are likewise reflective. These results provide logical foundations for reflective languages and tools based on these logics, and in particular for the Maude language itself.

Key words

Reflection
reflective logics
universal theory
reflective rewriting logic
reflective membership equational logic
reflective Horn logic with equality

Cited by (0)

1

Partially supported by a CICYT Project TIC2002-01167.

2

Supported in part by ONR Grant N00014-02-1-0715.

3

Supported by a postgraduate fellowship by the Spanish Ministry for Science and Technology.