CPO models for infinite term rewriting

DOI10.1007/3-540-60043-4_65zbMath1496.68163OpenAlexW1590378845MaRDI QIDQ5096397

Andrea Corradini, Fabio Gadducci

Publication date: 16 August 2022

Published in: Algebraic Methodology and Software Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60043-4_65

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42) Theories (e.g., algebraic theories), structure, and semantics (18C10)

Related Items (6)

Rewriting logic: Roadmap and bibliography ⋮ Relating two categorical models of term rewriting ⋮ Rewriting logic as a semantic framework for concurrency: a progress report ⋮ Term-Graph Rewriting Via Explicit Paths ⋮ Categorical rewriting of term-like structures ⋮ A causal semantics for CCS via rewriting logic

Cites Work

• Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
• Conditional rewriting logic as a unified model of concurrency
• Initial Algebra Semantics and Continuous Algebras
• Term rewriting in CTΣ
• An abstract formulation for rewrite systems
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: CPO models for infinite term rewriting