Abstract
LSE narrowing is known as an optimal narrowing strategy for arbitrary unconditional canonical term rewrite systems without additional properties such as orthogonality or constructor discipline. In this paper, we extend LSE narrowing to confluent and decreasing conditional term rewrite systems.
The first author's work was supported by the German Ministry for Research and Technology (BMFT) under grant ITS 9103 and the ESPRIT Working Group CCL (contract EP 6028). The second author's work was supported by the Deutsche Forschungsgemeinschaft as part of the SFB 314 (project S2).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Antoy, R. Echahed, and M. Hanus. A needed narrowing strategy. In 21st ACM Symposium on Principles of Programming Languages, POPL '94, Portland, pages 268–279, 1994.
A. Bockmayr. Contributions to the Theory of Logic-Functional Programming. PhD thesis, Fakultät für Informatik, Univ. Karlsruhe, 1990. (in German).
A. Bockmayr. Conditional narrowing modulo a set of equations. Applicable Algebra in Engineering, Communication and Computing, 4(3):147–168, 1993.
A. Bockmayr, S. Krischer, and A. Werner. An optimal narrowing strategy for general canonical systems. In Conditional Term Rewriting Systems, CTRS'92, Pont-à-Mousson, France. Springer, LNCS 656, 1992.
A. Bockmayr, S. Krischer, and A. Werner. Narrowing strategies for arbitrary canonical systems. Technical Report MPI-I-93-233, Max-Planck-Institut für Informatik, Saarbrücken, July 1993. To appear in Fundamenta Informaticae.
N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, chapter 6, pages 244–320. Elsevier, 1990.
N. Dershowitz and D. A. Plaisted. Logic programming cum applicative programming. In Proc. Intern. Symposium on Logic Programming, Boston. IEEE, 1985.
M. Fay. First-order unification in an equational theory. In 4th Workshop on Automated Deduction, Austin, Texas, 1979.
E. Giovannetti and C. Moiso. A completeness result for E-unification algorithms based on conditional narrowing. In Foundations of Logic and Functional Programming, Trento. Springer LNCS 306, 1986.
M. Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19&20:583–628, 1994.
A. Herold. Narrowing techniques applied to idempotent unification. SEKI-Report SR-86-16, Univ. Kaiserslautern, 1986.
G. Huet and D. C. Oppen. Equations and rewrite rules, A survey. In R. V. Book, editor, Formal Language Theory. Academic Press, 1980.
J. M. Hullot. Canonical forms and unification. In Proc. 5th Conference on Automated Deduction, Les Arcs. Springer, LNCS 87, 1980.
H. Hu\mann. Unification in conditional-equational theories. Technical Report MIP-8502, Univ. Passau, Jan. 1985. Short version: EUROCAL 85, Linz, Springer, LNCS 204.
S. Kaplan. Conditional rewrite rules. Theoretical Computer Science, 33:175–193, 1984.
S. Kaplan. Fair conditional term rewriting systems: Unification, termination and confluence. Technical Report 194, L. R. I., Univ. Paris-Sud, 1984.
J. W. Klop. Term rewriting systems. In S. Abramski, D. M. Gabbay, and T. S. Maibaum, editors, Handbook of Logic in Computer Science, volume 2 — Background: Computational Structures, pages 1–116. Oxford Univ. Press, 1992.
A. Middeldorp and E. Hamoen. Completeness results for basic narrowing. Applicable Algebra in Engineering, Communication and Computing, 5:213–253, 1994.
P. Réty. Improving basic narrowing techniques. In Proc. Rewriting Techniques and Applications RTA '87, Bordeaux. Springer, LNCS 256, 1987.
A. Werner, A. Bockmayr, and S. Krischer. How to realize LSE narrowing. Technical Report 6/93, Fakultät für Informatik, Univ. Karlsruhe, December 1993.
A. Werner, A. Bockmayr, and S. Krischer. How to realize LSE narrowing. In Algebraic and Logic Programming, ALP'94, Madrid, pages 59–76. Springer, LNCS 850, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bockmayr, A., Werner, A. (1995). LSE narrowing for decreasing conditional term rewrite systems. In: Dershowitz, N., Lindenstrauss, N. (eds) Conditional and Typed Rewriting Systems. CTRS 1994. Lecture Notes in Computer Science, vol 968. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60381-6_4
Download citation
DOI: https://doi.org/10.1007/3-540-60381-6_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60381-8
Online ISBN: 978-3-540-45513-4
eBook Packages: Springer Book Archive