Abstract
In this paper, we extend the results on the modularity of confluence and termination of single-sorted TRSs[3][6][7] to order-sorted ones. Order-sorted TRSs build a good framework for handling overloaded functions and subtypes. For proving modularity of completeness of order-sorted TRSs, we first transform a TRS with overloaded functions to a non-overloaded one, and then we demonstrate that our transformation preserves completeness.
The first author is currently with Nippon Telegraph and Telephone Corporation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Jan Willem Klop. Term rewriting systems. In S.Abramsky, D.M. Gabbai,and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, Volume 2, pages 1–116. Oxford University Press, 1992.
Isabelle Gnaedig, Termination of Order-sorted Rewriting. Algebraic and Logic Programming, volume 632 of Lecture Notes in Computer Science, pages 37–52. Springer-Verlag, 1992.
Jan Willem Klop, Aart Middeldorp, Yoshihito Toyama, and Roel de Vrijer, Modularity of Confluence: A Simplified Proof. Information Processing Letters, Vol. 49, pp. 101–109, 1994.
C.Kirchner, H.Kirchner, and J.Meseguer, Operational semantics of OBJ-3. In Proceedings of 15th International Colloquium on Automata, Languages and Programming, volume 317 of Lecture Notes in Computer Science, pages 287–301. Springer-Verlag, 1988.
Uwe Waldmann. Semantics of Order-Sorted Algebras. Theoretical Computer Science, 94, pages 1–33, 1992.
M. Rusinowitch. On termination of the direct sum of term rewriting systems. Information Processing Letters, 26:65–70, 1987.
A.Middeldorp. A sufficient condition for the termination of direct sum of term rewriting systems. In Proc. 4th IEEE Symposium on Logic in Computer Science, pages 396–401, Pacific Grove, IEEE Press, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kawabe, Y., Ishii, N. (1997). On modularity of completeness in order-sorted term rewriting systems. In: Jiang, T., Lee, D.T. (eds) Computing and Combinatorics. COCOON 1997. Lecture Notes in Computer Science, vol 1276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0045100
Download citation
DOI: https://doi.org/10.1007/BFb0045100
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63357-0
Online ISBN: 978-3-540-69522-6
eBook Packages: Springer Book Archive