Modular termination of prefix-constrained term rewrite systems

[1]  Bernhard Gramlich,et al.  Generalized sufficient conditions for modular termination of rewriting , 1992, Applicable Algebra in Engineering, Communication and Computing.

[2]  Aart Middeldorp,et al.  A sufficient condition for the termination of the direct sum of term rewriting systems , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[3]  Florent Jacquemard,et al.  Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies , 2015, CADE.

[4]  Salvador Lucas,et al.  Modular termination of context-sensitive rewriting , 2002, PPDP '02.

[5]  Pierre Réty,et al.  Transforming Prefix-constrained or Controlled Rewrite Systems , 2017, SCSS.

[6]  Yoshihito Toyama,et al.  Counterexamples to Termination for the Direct Sum of Term Rewriting Systems , 1987, Inf. Process. Lett..

[7]  Jean-Pierre Jouannaud,et al.  Modular Termination of Term Rewriting Systems Revisited , 1994, COMPASS/ADT.

[8]  Salvador Lucas.  Context-sensitive Rewriting , 2020, ACM Comput. Surv..

[9]  Hendrik Pieter Barendregt,et al.  Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft- , 1989, RTA.

[10]  Enno Ohlebusch,et al.  On the Modularity of Termination of Term Rewriting Systems , 1994, Theor. Comput. Sci..

[11]  Michaël Rusinowitch,et al.  On Termination of the Direct Sum of Term-Rewriting Systems , 1987, Inf. Process. Lett..

[12]  Bernhard Gramlich,et al.  Modularity in term rewriting revisited , 2012, Theor. Comput. Sci..