Transformation for Refining Unraveled Conditional Term Rewriting Systems

Authors:
Naoki Nishida;Tomohiro Mizutani;Masahiko Sakai
Affiliations:
Graduate School of Information Science, Nagoya University, Nagoya, Japan;Graduate School of Information Science, Nagoya University, Nagoya, Japan;Graduate School of Information Science, Nagoya University, Nagoya, Japan
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 11
Cited 0

Conditional rewrite rules: Confluence and termination

Journal of Computer and System Sciences
Confluent term rewriting systems with membership conditions

1st international workshop on Conditional Term Rewriting Systems
Term rewriting and all that

Term rewriting and all that
Elimination of conditions

Journal of Symbolic Computation
Advanced topics in term rewriting

Advanced topics in term rewriting
Unravelings and Ultra-properties

ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
Conditional narrowing without conditions

Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Proving termination of membership equational programs

Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Operational termination of conditional term rewriting systems

Information Processing Letters
From conditional to unconditional rewriting

WADT'04 Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques
Partial inversion of constructor term rewriting systems

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.