Transformation for Refining Unraveled Conditional Term Rewriting Systems

Unravelings, transformations from conditional term rewriting systems (CTRSs, for short) into unconditional term rewriting systems, are valuable for analyzing properties of CTRSs. In order to completely simulate rewrite sequences of CTRSs, the restriction by a particular context-sensitive and membership condition that is determined by extra function symbols introduced due to the unravelings, must be imposed on the rewrite relations of the unraveled CTRSs. In this paper, in order to weaken the context-sensitive and membership condition, we propose a transformation applied to the unraveled CTRSs, that reduces the number of the extra symbols. In the transformation, updating the context-sensitive condition properly, we remove the extra symbols that satisfy a certain condition. If the transformation succeeds in removing all of the extra symbols, we obtain the TRSs that are computationally equivalent with the original CTRSs.

[1]  Yoshihito Toyama,et al.  Confluent Term Rewriting Systems with Membership Conditions , 1988, CTRS.

[2]  Enno Ohlebusch,et al.  Advanced Topics in Term Rewriting , 2002, Springer New York.

[3]  José Meseguer,et al.  Operational termination of conditional term rewriting systems , 2005, Inf. Process. Lett..

[4]  Alexander K. Petrenko,et al.  Electronic Notes in Theoretical Computer Science , 2009 .

[5]  Masahiko Sakai,et al.  Partial Inversion of Constructor Term Rewriting Systems , 2005, RTA.

[6]  Nishida Naoki,et al.  On Simulation-Completeness of Unraveling for Conditional Term Rewriting Systems , 2004 .

[7]  Massimo Marchiori,et al.  Unravelings and Ultra-properties , 1996, ALP.

[8]  Michael Hanus,et al.  Conditional narrowing without conditions , 2003, PPDP '03.

[9]  Michael Leuschel.  Proceedings of the 2003 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation, 2003, San Diego, California, USA, June 7, 2003 , 2003, PEPM.

[10]  Enno Ohlebusch,et al.  Termination of Logic Programs: Transformational Methods Revisited , 2001, Applicable Algebra in Engineering, Communication and Computing.

[11]  Salvador Lucas,et al.  Context-sensitive Computations in Functional and Functional Logic Programs , 1998, J. Funct. Log. Program..

[12]  Grigore Rosu,et al.  Computationally Equivalent Elimination of Conditions , 2006, RTA.

[13]  Salvador Lucas,et al.  OnDemandOBJ: A Laboratory for Strategy Annotations , 2003, Electron. Notes Theor. Comput. Sci..

[14]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[15]  Grigore Rosu,et al.  From Conditional to Unconditional Rewriting , 2004, WADT.

[16]  Francisco Durán,et al.  Proving termination of membership equational programs , 2004, PEPM '04.

[17]  Patrick Viry,et al.  Elimination of Conditions , 1995, J. Symb. Comput..

[18]  Jan A. Bergstra,et al.  Conditional Rewrite Rules: Confluence and Termination , 1986, J. Comput. Syst. Sci..

[19]  Roberto Bruni,et al.  Recent Trends in Algebraic Development Techniques , 2002, Lecture Notes in Computer Science.

[20]  Masahiko Sakai,et al.  Narrowing-based simulation of term rewriting systems with extra variables , 2003, WFLP.