Relating two categorical models of term rewriting

DOI10.1007/3-540-59200-8_59OpenAlexW1832683456MaRDI QIDQ5055833

Fabio Gadducci, Andrea Corradini, Ugo Montanari

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59200-8_59

zbMATH Keywords

categorical modelsconcurrencyterm rewritingrewriting logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Theories (e.g., algebraic theories), structure, and semantics (18C10) 2-categories, bicategories, double categories (18N10)

Related Items

Rewriting logic: Roadmap and bibliography, Rewriting logic as a semantic framework for concurrency: a progress report, A functorial semantics for multi-algebras and partial algebras, with applications to syntax., Tile formats for located and mobile systems., A causal semantics for CCS via rewriting logic, Relating conflict-free stable transition and event models via redex families, Comparing logics for rewriting: Rewriting logic, action calculi and tile logic

Cites Work

• Conditional rewriting logic as a unified model of concurrency
• Semantics of weakening and contraction
• Initial Algebra Semantics and Continuous Algebras
• An abstract formulation for rewrite systems
• CPO models for infinite term rewriting
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item