Proving and Disproving Termination of Constrained Term Rewriting Systems


In this paper, we propose methods for proving and disproving termination of constrained term rewriting systems, where constraints are interpreted by built-in semantics given by users, and rewrite rules are sound for the interpretation, i.e., the interpretation of terms is preserved under the reduction. The method for proving termination is a straightforward… (More)


6 Figures and Tables

Slides referencing similar topics