Reflection in membership equational logic, many-sorted equational logic, horn logic with equality, and rewriting logic

Manuel Clavel, José Meseguer, Miguel Palomino

Research output: Contribution to journalConference article

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.

Original languageEnglish (US)
Pages (from-to)110-126
Number of pages17
JournalElectronic Notes in Theoretical Computer Science
Volume71
DOIs
StatePublished - Apr 2004
EventWRLA 2002, Rewriting Logic and it's Applications - Pisa, Italy
Duration: Sep 19 2002Sep 21 2002

Keywords

  • Reflection
  • Reflective Horn logic with equality
  • Reflective logics
  • Reflective membership equational logic
  • Reflective rewriting logic
  • Universal theory

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Reflection in membership equational logic, many-sorted equational logic, horn logic with equality, and rewriting logic'. Together they form a unique fingerprint.

  • Cite this