TY - CHAP
T1 - Functorial semantics of rewrite theories
AU - Meseguer, José
PY - 2005
Y1 - 2005
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=36849010650&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=36849010650&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-31847-7_13
DO - 10.1007/978-3-540-31847-7_13
M3 - Chapter
AN - SCOPUS:36849010650
SN - 3540249362
SN - 9783540249368
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 220
EP - 235
BT - Formal Methods in Software and Systems Modeling
PB - Springer
ER -