Transforming Prefix-Constrained or Controlled Rewrite Systems

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 computations, and preserve termination. In this way, prefix-constrained rewriting and controlled rewriting can be run, and termination can be checked, thanks to the usual techniques and tools for ordinary rewriting.
Document type :
Conference papers
Complete list of metadatas
Contributor : Pierre Réty <>
Submitted on : Wednesday, January 25, 2017 - 11:13:51 AM
Last modification on : Thursday, January 17, 2019 - 3:10:02 PM


  • HAL Id : hal-01445668, version 1



Nirina Andrianarivelo, Vivien Pelletier, Pierre Réty. Transforming Prefix-Constrained or Controlled Rewrite Systems. 8th International Symposium on Symbolic Computation in Software Science (SCSS 2017), Apr 2017, Gammarth, Tunisia. ⟨hal-01445668⟩



Record views