Term rewriting in CT_
From MaRDI portal
Publication:5044755
Recommendations
Cites work
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
- Implementing term rewriting by jungle evaluation
- Initial Algebra Semantics and Continuous Algebras
- On ``On graph rewritings
- On graph rewritings
- Tree-Manipulating Systems and Church-Rosser Theorems
Cited in
(12)- Transitive term graph rewriting
- Descendants and origins in term rewriting.
- Commutative rational term rewriting
- Towards a sharing strategy for the graph rewriting calculus
- scientific article; zbMATH DE number 1189296 (Why is no real title available?)
- scientific article; zbMATH DE number 176143 (Why is no real title available?)
- scientific article; zbMATH DE number 1231494 (Why is no real title available?)
- scientific article; zbMATH DE number 1543080 (Why is no real title available?)
- Term graph rewriting and parallel term rewriting
- Algebraic semantics and complexity of term rewriting systems
- CPO models for infinite term rewriting
- Linear matching-time algorithm for the directed graph isomorphism problem
This page was built for publication: Term rewriting in \(\mathrm{CT}_\Sigma \)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5044755)