Abstract
Let F be a signature and \( \mathcal{R} \) a term rewrite system on ground terms of F. We define the concepts of a context-free potential redex in a term and of bounded confluent terms. We bound recursively the lengths of derivations of a bounded confluent term t by a function of the length of derivations of context-free potential redexes of this term. We define the concept of inner redex and we apply the recursive bounds that we obtained to prove that, whenever \( \mathcal{R} \) is a confluent overlay term rewrite system, the derivational length bound for arbitrary terms is an iteration of the derivational length bound for inner redexes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Baader and T. Nipkow Term Rewriting and All That. Cambridge University Press (1998).
G. Bonfante and A. Cichon and J-Y Marion and H. Touzet Complexity classes and rewrite systems with polynomial interpretation, Lecture Notes in Computer Science, 1584 (1999) 372–384
E.A. Cichon, E. Tahhan. Strictly Orthogonal Left-Linear Rewrite Systems and Primitive Recursion. Annals of Pure and Applied Logic. 108 (2001) 79–102.
N. Dershowitz, J.P. Jouannaud. Rewrite Systems. Handbook of Theoretical Computer Science, Volume B, Elsevier, Amsterdam (1990) 243–320.
Dieter Hofbauer. Termination proofs by multiset path orderings imply primitive recursive derivation lengths Theoretical Computer Science 105(1) (1992) 129–140.
G. Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. J. Assoc. Comput. Mach. 27(4) (1980) 797–821.
G. Huet, J.-J. Lévy. Computations in orthogonal rewriting systems, I and II. Computational Logic: Essays in Honor of Alan Robinson, Ed. J.-L. Lassez and G. Plotkin, MIT Press (1991) 395–443.
Bernhard Gramlich Abstract Relations between Restricted Termination and Confluence Properties of Rewrite Systems. Fundamenta Informaticae 24 (1995) 3–23.
Zurab Khasidashvili. Perpetuality and Strong Normalization in Orthogonal Term Rewriting Systems. Lecture Notes in Computer Science 775 (1994) 163–174.
M.J. O’Donnell. Computing in Systems Described by Equations. Lecture Notes in Computer Science 58 (1977).
A. Weiermann, Termination proofs for term rewriting systems with lexicographic path orderings imply multiply recursive derivation lengths, Theoretical Computer Science 139 (1995) 355–362.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tahhan-Bittar, E. (2002). Recursive Derivational Length Bounds for Confluent Term Rewrite Systems Research Paper. In: Tison, S. (eds) Rewriting Techniques and Applications. RTA 2002. Lecture Notes in Computer Science, vol 2378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45610-4_20
Download citation
DOI: https://doi.org/10.1007/3-540-45610-4_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43916-5
Online ISBN: 978-3-540-45610-0
eBook Packages: Springer Book Archive