Metalevel computation in maude

M. Clavel, F. Duran, S. Eker, P. Lincoln, N. Marti-Oliet, J. Meseguer

Research output: Contribution to journalArticlepeer-review

Abstract

Maude's language design and implementation make systematic use of the fact that rewriting logic is reflective. This makes the metatheory of rewriting logic accessible to the user in a clear and principled way, and makes possible many advanced metaprogramming applications, including user-definable strategy languages, language extensions by new module composition operations, development of theorem proving tools, and reifications of other languages and logics within rewriting logic. A naive implementation of reflection can be computationally very expensive. We explain the semantic principles and implementation techniques through which efficient ways of performing reflective computations are achieved in Maude through its predefined META-LEVEL module.

Original languageEnglish (US)
Pages (from-to)331-352
Number of pages22
JournalElectronic Notes in Theoretical Computer Science
Volume15
DOIs
StatePublished - 1998
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Metalevel computation in maude'. Together they form a unique fingerprint.

Cite this