Similar Items: Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories
- Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus
- Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
- Rewriting Modulo Traced Comonoid Structure
- Canonized Rewriting and Ground AC Completion Modulo Shostak Theories : Design and Implementation
- Cartesian closed 2-categories and permutation equivalence in higher-order rewriting
- Termination of Cycle Rewriting by Transformation and Matrix Interpretation