CPO models for infinite term rewriting

DOI10.1007/3-540-60043-4_65zbMATH Open1496.68163OpenAlexW1590378845MaRDI QIDQ5096397FDOQ5096397

Authors: 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

Recommendations

• Infinite terms and infinite rewritings
• Term rewriting in \(\mathrm{CT}_\Sigma \)
• scientific article; zbMATH DE number 1231494
• Infinitary rewriting: closure operators, equivalences and models
• Infinitary rewriting: foundations revisited

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Initial Algebra Semantics and Continuous Algebras
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
• Title not available (Why is that?)
• Title not available (Why is that?)
• Conditional rewriting logic as a unified model of concurrency
• Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
• Title not available (Why is that?)
• An abstract formulation for rewrite systems
• Term rewriting in \(\mathrm{CT}_\Sigma \)
• Term graph rewriting and parallel term rewriting

Cited In (9)

• Term-Graph Rewriting Via Explicit Paths
• Title not available (Why is that?)
• Rewriting logic as a semantic framework for concurrency: a progress report
• Infinite terms and infinite rewritings
• A causal semantics for CCS via rewriting logic
• Relating two categorical models of term rewriting
• Term rewriting in \(\mathrm{CT}_\Sigma \)
• Rewriting logic: Roadmap and bibliography
• Categorical rewriting of term-like structures

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096397)