Relating two categorical models of term rewriting
From MaRDI portal
(Redirected from Publication:5055833)
Logic in computer science (03B70) Theories (e.g., algebraic theories), structure, and semantics (18C10) 2-categories, bicategories, double categories (18N10) Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
- Categorical rewriting of term-like structures
- Categorification, term rewriting and the Knuth-Bendix procedure
- scientific article; zbMATH DE number 1086713
- Computational Category-Theoretic Rewriting
- Computational category-theoretic rewriting
- Presenting a Category Modulo a Rewriting System
- Categorical models of logical systems in the mathematical theory of programming
- scientific article; zbMATH DE number 1231534
- Classifying spaces of categories and term rewriting
- scientific article; zbMATH DE number 4202235
Cites work
- An abstract formulation for rewrite systems
- Conditional rewriting logic as a unified model of concurrency
- CPO models for infinite term rewriting
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- scientific article; zbMATH DE number 3988695 (Why is no real title available?)
- scientific article; zbMATH DE number 3735770 (Why is no real title available?)
- scientific article; zbMATH DE number 3751225 (Why is no real title available?)
- scientific article; zbMATH DE number 3522194 (Why is no real title available?)
- scientific article; zbMATH DE number 1231543 (Why is no real title available?)
- scientific article; zbMATH DE number 627411 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- Initial Algebra Semantics and Continuous Algebras
- Semantics of weakening and contraction
Cited in
(15)- 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
- Rewriting logic: Roadmap and bibliography
- A functorial semantics for multi-algebras and partial algebras, with applications to syntax.
- Relaxed models for rewriting logic
- Tile formats for located and mobile systems.
- A natural semantic framework for ECATNets
- scientific article; zbMATH DE number 431765 (Why is no real title available?)
- scientific article; zbMATH DE number 139987 (Why is no real title available?)
- scientific article; zbMATH DE number 1231534 (Why is no real title available?)
- Categorical rewriting of term-like structures
- Presenting a Category Modulo a Rewriting System
- Formal Methods in Software and Systems Modeling
- Rewriting logic as a semantic framework for concurrency: a progress report
This page was built for publication: Relating two categorical models of term rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055833)