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. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Meseguer, J. (2005). Functorial semantics of rewrite theories. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3393 LNCS, 220–235. https://doi.org/10.1007/978-3-540-31847-7_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
