Abstract
Level-confluence is an important property of conditional term rewriting systems that allow extra variables in the rewrite rule because it guarantees the completeness of narrowing for such systems. In this paper we present a syntactic condition ensuring level-confluence for orthogonal, not necessarily terminating, conditional term rewriting systems that have extra variables in the right-hand sides of the rewrite rules. To this end we generalize the parallel moves lemma. Our result bears practical significance since the class of systems that fall within its scope can be viewed as a computational model for functional logic programming languages with local definitions, such as let-expressions and where-constructs.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Antoy and A. Middeldorp, A Sequential Reduction Strategy, Proc. ALP-94, Madrid, LNCS 850, pp. 168–185, 1994.
J. Avenhaus and C. LorÃa-Sáenz, On Conditional Rewrite Systems with Extra Variables and Deterministic Logic Programs, Proc. LPAR-94, Kiev, LNAI 822, 1994.
J.A. Bergstra and J.W. Klop, Conditional Rewrite Rules: Confluence and Termination, JCSS 32(3), pp. 323–362, 1986.
H. Bertling and H. Ganzinger, Completion-Time Optimization of Rewrite-Time Goal Solving, Proc. RTA-89, LNCS 355, pp. 45–58, 1989.
N. Dershowitz and J.-P. Jouannaud, Rewrite Systems, in: Handbook of Theoretical Computer Science, Vol. B ed. J. van Leeuwen, North-Holland, pp. 243–320, 1990.
N. Dershowitz and M. Okada, A Rationale for Conditional Equational Programming, TCS 75, pp. 111–138, 1990.
N. Dershowitz, M. Okada, and G. Sivakumar, Confluence of Conditional Rewrite Systems, Proc. CTRS-87, Orsay, LNCS 308, pp. 31–44, 1987.
E. Giovannetti, G. Levi, C. Moiso, and C. Palamidessi, Kernel-LEAF: A Logic plus Functional Language, JCSS 42(2), pp. 139–185, 1991.
E. Giovannetti and C. Moiso, A Completeness Result for E-Unification Algorithms based on Conditional Narrowing, Proc. Workshop on Foundations of Logic and Functional Programming, Trento, LNCS 306, pp. 157–167, 1986.
Juan Carlos González-Moreno, M.T. Hortalá-González, M. RodrÃguez-Artalejo, Denotational versus Declarative Semantics for Functional Programming, Proc. CSL-92, Berne, LNCS 626, pp. 134–148, 1992.
B. Gramlich, On Termination and Confluence of Conditional Rewrite Systems, Proc. CTRS-94, Jerusalem, LNCS, 1994. To appear.
M. Hanus, The Integration of Functions into Logic Programming: From Theory to Practice, JLP 19&20, pp. 583–628, 1994.
M. Hanus, On Extra Variables in (Equational) Logic Programming, report MPI-I-94-246, Max-Planck-Institut für Informatik, 1994.
T. Ida and S. Okui, Outside-In Conditional Narrowing, IEICE Transactions on Information and Systems, E77-D(6), pp. 631–641, 1994.
J.W. Klop, Term Rewriting Systems, in: Handbook of Logic in Computer Science, Vol. II (eds. S. Abramsky, D. Gabbay and T. Maibaum), Oxford University Press, pp. 1–116, 1992.
A. Middeldorp, Completeness of Combinations of Conditional Constructor Systems, JSC 17, pp. 3–21, 1994.
A. Middeldorp and E. Hamoen, Completeness Results for Basic Narrowing, AAECC 5, pp. 213–253, 1994.
J.J. Moreno-Navarro and M. Rodrìguez-Artalejo, Logic Programming with Functions and Predicates: The Language BABEL, JLP 12, pp. 191–223, 1992.
E. Ohlebusch, Modular Properties of Constructor-Sharing Conditional Term Rewriting Systems, Proc. CTRS-94, Jerusalem, LNCS, 1994. To appear.
P. Padawitz, Generic Induction Proofs, Proc. CTRS-92, Pont-à -Mousson, LNCS 656, pp. 175–197, 1993.
Y. Toyama and M. Oyamaguchi, Church-Rosser Property and Unique Normal Form Property of Non-Duplicating Term Rewriting Systems, Proc. CTRS-94, Jerusalem, LNCS, 1994. To appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Suzuki, T., Middeldorp, A., Ida, T. (1995). Level-confluence of conditional rewrite systems with extra variables in right-hand sides. In: Hsiang, J. (eds) Rewriting Techniques and Applications. RTA 1995. Lecture Notes in Computer Science, vol 914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59200-8_56
Download citation
DOI: https://doi.org/10.1007/3-540-59200-8_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59200-6
Online ISBN: 978-3-540-49223-8
eBook Packages: Springer Book Archive