An extensible module algebra for maude

Francisco Duran, Jose Meseguer

Research output: Contribution to journalArticlepeer-review

Abstract

The fact that rewriting logic and Maude are reflective, so that rewriting logic specifications can be manipulated as terms at the metalevel, opens up the possibility of defining an algebra of module composition and transformation operations within the logic. This makes such a module algebra easily modifiable and extensible, enables the implementation of language extensions within Maude, and allows formal reasoning about the module operations themselves. In this paper we discuss in detail the Maude implementation of a specific choice of operations for a module algebra of this type, supporting module operations in the Clear/OBJ tradition as well as the transformation of object-oriented modules into system modules.

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'An extensible module algebra for maude'. Together they form a unique fingerprint.

Cite this