Abstract
We prove constructively that the class of ground-confluent and decreasing conditional term rewriting systems (CTRSs) (without extra variables) coincides with the class of orthogonal and terminating, unconditional term rewriting systems (TRSs). TRSs being included in CTRSs, this result follows from a transformation from any ground-confluent and decreasing CTRS specifying a computable function f into a TRS with the mentioned properties for f. The generated TRS is ordersorted, but we outline a similar transformation yielding an unsorted TRS.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
H. Aida, G. Goguen, and J. Meseguer. Compiling concurrent rewriting onto the rewrite rule machine. In S. Kaplan and M. Okada, editors, Proceedings 2nd International Workshop on Conditional and Typed Rewriting Systems, Montreal (Canada), volume 516 of LNCS, pages 320–332. Springer-Verlag, June 1990.
L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder. Basic paramodulation and superposition. In Proceedings 11th International Conference on Automated Deduction, Saratoga Springs (N. Y., USA), pages 462–476, 1992.
J. A. Bergstra and J. W. Klop. Conditional rewrite rules: Confluency and termination. Journal of Computer and System Sciences, 32(3):323–362, 1986.
J. A. Bergstra and J. V. Tucker. A characterisation of computable data types by means of a finite equational specification method. In J.W. de Bakker and J. van Leuwen, editors, Proceedings 7th ICALP Conference, Noordwijkerhout, volume 81 of LNCS, pages 76–90. Springer-Verlag, 1980.
J. A. Bergstra and J. V. Tucker. Algebraic specifications of computable and semicomputable data structures. Theoretical Computer Science, 50:137–181, 1987.
H. Bertling and H. Ganzinger. Compile-time optimization of rewrite-time goal solving. In N. Dershowitz, editor, Proceedings 3rd Conference on Rewriting Techniques and Applications, Chapel Hill (N.C., USA), volume 355 of LNCS, pages 45–58. Springer-Verlag, April 1989.
P.G. Bosco, C. Cecchi, and C. Moiso. An extension of WAM for K-LEAF: a WAM-based compilation of conditional narrowing. In Proceedings Sixth International Conference on Logic Programming, Lisboa (Portugal), pages 325–339. The MIT press, 1989.
S. Burris. Discriminator varieties and symbolic computation. Journal of Symbolic Computation, 13(2):175–208, February 1992.
M. Dauchet. Simulation of Turing machines by a left-linear rewrite rule. In N. Dershowitz, editor, Proceedings 3rd Conference on Rewriting Techniques and Applications, Chapel Hill (N.C., USA), volume 355 of LNCS, pages 109–120. Springer-Verlag, April 1989.
N. Dershowitz and J.-P. Jouannaud. Handbook of Theoretical Computer Science, volume B, chapter 6: Rewrite Systems, pages 244–320. Elsevier Science Publishers B. V. (North-Holland), 1990. Also as: Research report 478, LRI.
N. Dershowitz and M. Okada. A rationale for conditional equational programming. Theoretical Computer Science, 75:111–138, 1990.
N. Dershowitz and D. A. Plaisted. Equational Programming, pages 21–56. J. Richards, Oxford, 1988. Machine Intelligence 11: The Logic and Acquisition of knowledge.
H. Ganzinger. A completion procedure for conditional equations. Journal of Symbolic Computation, 11:51–81, 1991.
H. Ganzinger. Order-sorted completion: the many-sorted way. Theoretical Computer Science, 89(1):3–32, 1991.
E. Giovannetti and C. Moisi. Notes on the elimination of conditions. In J.-P. Jouannaud and S. Kaplan, editors, Proceedings 1st International Workshop on Conditional Term Rewriting Systems, Orsay (France), volume 308 of LNCS. Springer-Verlag, July 1987.
I. Gnaedig. ELIOS-OBJ: Theorem proving in a specification language. In B. Krieg-Brückner, editor, Proceedings of the 4th European Symposium on Programming, volume 582 of LNCS, pages 182–199. Springer-Verlag, February 1992.
J. A. Goguen. The rewrite rule machine project. In Proceedings of the second international conference on supercomputing, Santa Clara, California, May 1987.
M. Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19&20:583–628, 1994.
M. Hanus. On extra variables in (equational) logic programming. Technical Report MPI-I-94-246, Max-Planck-Institut Saarbrücken, 1994.
C. Hintermeier, C. Kirchner, and H. Kirchner. Dynamically-typed computations for order-sorted equational presentations. In S. Abiteboul and E. Shamir, editors, Proc. 21st ICALP Conference, volume 820 of LNCS, pages 450–461. Springer-Verlag, 1994.
G. Huet and D. S. Lankford. On the uniform halting problem for term rewriting systems. Technical Report 283, IRIA — Laboria, France, 1978.
G. Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the ACM, 27(4):797–821, October 1980. Preliminary version in 18th Symposium on Foundations of Computer Science, IEEE, 1977.
N. Alan Josephson and Nachum Dershowitz. An implementation of narrowing. Journal of Logic Programming, 6(1&2):57–77, March 1989.
J.-P. Jouannaud and Claude Kirchner. Solving equations in abstract algebras: a rule-based survey of unification. In Jean-Louis Lassez and G. Plotkin, editors, Computational Logic. Essays in honor of Alan Robinson, chapter 8, pages 257–321. The MIT press, Cambridge (MA, USA), 1991.
S. Kaplan. A compiler for conditional term rewriting systems. In P. Lescanne, editor, Proceedings 2nd Conference on Rewriting Techniques and Applications, Bordeaux (France), volume 256 of LNCS, pages 25–41, Bordeaux (France), May 1987. Springer-Verlag.
Claude Kirchner and P. Viry. Implementing parallel rewriting. In B. Fronhöfer and G. Wrightson, editors, Parallelization in Inference Systems, volume 590 of LNAI, pages 123–138. Springer-Verlag, 1992.
Claude Kirchner, Hélène Kirchner, and J. Meseguer. Operational semantics of OBJ-3. In Proceedings of 15th ICALP Conference, volume 317 of LNCS, pages 287–301. Springer-Verlag, 1988.
G. Sivakumar. Proofs and computations in conditional equational theories. Phd thesis, University of Illinois, Urbana-Champaign (IL/USA), 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hintermeier, C. (1995). How to transform canonical decreasing CTRSs into equivalent canonical TRSs. 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_11
Download citation
DOI: https://doi.org/10.1007/3-540-60381-6_11
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