Functorial semantics of rewrite theories

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

This paper develops a close analogy between Lawvere's functorial semantics of equational theories [21], and a similar 2-functorial semantics for rewrite theories, which specify concurrent systems and whose models are "true concurrency" models of such systems. This has the advantage of unifying within a single 2-functorial framework both models and rewrite theory morphisms. Such morphisms are used in Maude to "put rewrite theories together" in different constructions, including parameterized rewrite theory specifications.

Original languageEnglish (US)
Title of host publicationFormal Methods in Software and Systems Modeling
Subtitle of host publicationEssays Dedicated to Hartmut Ehrig on the Occasion of His 60th Birthday
PublisherSpringer-Verlag Berlin Heidelberg
Pages220-235
Number of pages16
ISBN (Print)3540249362, 9783540249368
DOIs
StatePublished - Jan 1 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3393 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Functorial semantics of rewrite theories'. Together they form a unique fingerprint.

  • Cite this

    Meseguer, J. (2005). Functorial semantics of rewrite theories. In Formal Methods in Software and Systems Modeling: Essays Dedicated to Hartmut Ehrig on the Occasion of His 60th Birthday (pp. 220-235). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3393 LNCS). Springer-Verlag Berlin Heidelberg. https://doi.org/10.1007/978-3-540-31847-7_13