Transforming Prefix-constrained or Controlled Rewrite Systems

14 pagesPublished: March 26, 2017

Abstract

We present two techniques for transforming any prefix-constrained and any controlled term rewrite system into an ordinary rewrite system. We prove that both transformations preserve the rewrite com- putations, and preserve termination. In this way, prefix-constrained rewriting and controlled rewriting can be run, and termination can be checked, using the usual tools for ordinary rewriting.

Keyphrases: Controlled rewrite system, Prefix-constrained rewrite system, term rewriting, termination

In: Mohamed Mosbah and Michael Rusinowitch (editors). SCSS 2017. The 8th International Symposium on Symbolic Computation in Software Science 2017, vol 45, pages 49--62