Functorial semantics of rewrite theories

Authors:
José Meseguer
Affiliations:
University of Illinois at Urbana-Champaign
Venue:
Formal Methods in Software and Systems Modeling
Year:
2005

Citing 14
Cited 1

Fundamentals of algebraic specification 2: module specifications and constraints

Fundamentals of algebraic specification 2: module specifications and constraints
Petri nets are moniods

Information and Computation
Rewrite systems

Handbook of theoretical computer science (vol. B)
Conditional rewriting logic as a unified model of concurrency

Selected papers of the Second Workshop on Concurrency and compositionality
The tile model

Proof, language, and interaction
Fundamentals of Algebraic Specification I

Fundamentals of Algebraic Specification I
Maude: specification and programming in rewriting logic

Theoretical Computer Science - Rewriting logic and its applications
Membership algebra as a logical framework for equational specification

WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Mapping tile logic into rewriting logic

WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Relating Two Categorial Models of Term Rewriting

RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Foundations of Equational Deduction: A Categorical Treatment of Equational Proofs and Unification Algorithms

Category Theory and Computer Science
Symmetric monoidal and cartesian double categories as a semantic framework for tile logic

Mathematical Structures in Computer Science
Putting theories together to make specifications

IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
Generalized rewrite theories

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Semantic foundations for generalized rewrite theories

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.