Similar Items: The computability path ordering
- Polynomial Path Orders
- Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing
- Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries
- Modular Termination for Second-Order Computation Rules and Application to Algebraic Effect Handlers
- All-Path Reachability Logic
- Modular Path Queries with Arithmetic