Remarks on Thatte's transformation of term rewriting systems

Authors:
Bas Luttik;Piet Rodenburg;Rakesh Verma
Affiliations:
Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands and CWI, P.O. Box 94079, NL-1090 GB Amsterdam, The Netherlan ...;Programming Research Group, University of Amsterdam, Kruislaan 403, NL-1098 SJ Amsterdam, The Netherlands;Computer Science Department, University of Houston, TX 77204, United States
Venue:
Information and Computation
Year:
2004

Citing 11
Cited 0

On the correspondence between two classes of reduction systems

Information Processing Letters
Implementing first-order rewriting with constructor systems (Note)

Theoretical Computer Science
Rewrite systems

Handbook of theoretical computer science (vol. B)
On the adequacy of graph rewriting for simulating term rewriting

ACM Transactions on Programming Languages and Systems (TOPLAS)
A theory of using history for equational systems with applications

Journal of the ACM (JACM)
Transformations and confluence for rewrite systems

Theoretical Computer Science
Forward and backward simulations I.: untimed systems

Information and Computation
Confluence of curried term-rewriting systems

Journal of Symbolic Computation
Comparing curried and uncurried rewriting

Journal of Symbolic Computation
Simulation as a Correct Transformation of Rewrite Systems

MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Minimal Term Rewriting Systems

Selected papers from the 11th Workshop on Specification of Abstract Data Types Joint with the 8th COMPASS Workshop on Recent Trends in Data Type Specification

Quantified Score

Hi-index	0.00

Visualization

Abstract

We carry out a detailed analysis of Thatte's transformation of term rewriting systems. We refute an earlier claim that this transformation preserves confluence for weakly persistent systems. We prove the preservation of weak normalization, and of confluence in weakly normalizing systems and in nonoverlapping systems with linear subtemplates. We conclude by proving that weak persistence is an undecidable property of term rewriting systems.