CPO models for infinite term rewriting
From MaRDI portal
Publication:5096397
Recommendations
Cites work
- An abstract formulation for rewrite systems
- Conditional rewriting logic as a unified model of concurrency
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- scientific article; zbMATH DE number 4085643 (Why is no real title available?)
- scientific article; zbMATH DE number 46995 (Why is no real title available?)
- scientific article; zbMATH DE number 3522194 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- Initial Algebra Semantics and Continuous Algebras
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
- Term graph rewriting and parallel term rewriting
- Term rewriting in \(\mathrm{CT}_\Sigma \)
Cited in
(10)- A causal semantics for CCS via rewriting logic
- Rewriting logic: Roadmap and bibliography
- Term-Graph Rewriting Via Explicit Paths
- scientific article; zbMATH DE number 1189296 (Why is no real title available?)
- scientific article; zbMATH DE number 1231494 (Why is no real title available?)
- Categorical rewriting of term-like structures
- Term rewriting in \(\mathrm{CT}_\Sigma \)
- Relating two categorical models of term rewriting
- Infinite terms and infinite rewritings
- Rewriting logic as a semantic framework for concurrency: a progress report
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)