Similar Items: Faithful (meta-)encodings of programmable strategies into term rewriting systems
- Small Term Reachability and Related Problems for Terminating Term Rewriting Systems
- Complexity of Conditional Term Rewriting
- Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples
- Modes of Convergence for Term Graph Rewriting
- Modular Complexity Analysis for Term Rewriting
- Partial Order Infinitary Term Rewriting