Abstract
In this paper, we propose a sufficient condition for modularity of completeness of hierarchical combinations. The sufficient condition is a syntactic one (about recursion) based on constructor discipline. Our result generalizes Middeldorp and Toyama's result on modularity of completeness for shared constructor systems.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
L. Bachmair and N. Dershowitz (1986), Commutation, Transformation and Termination, in proc. CADE'8, LNCS Vol. 230, pp. 5–20, Springer-Verlag.
N. Dershowitz and J.-P. Jouannaud (1990), Rewrite Systems, In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, North-Holland, pp. 243–320.
N. Dershowitz (1992), Hierarchical Termination, draft, Hebrew University, Jerusalem 91904, Israel, December 1992.
K. Drosten (1989), termersetzungssysteme, Informatik-Fachberichte Vol. 210, Springer.
B. Gramlich (1992), Relating Innermost, Weak, Uniform and Modular Termination of Term Rewrite systems, proc. Logic Programming and Automated Reasoning, LPAR'92, Springer LNCS. 624.
B.Gramlich (1992), Generalized sufficient conditions for Modular Termination of Rewriting, proc. Int. Conf. on Algebraic and Logic Programming, ALP'92, Springer LNCS. 632.
J.W. Klop (1990), Term Rewriting Systems, tech rep. CS-R9073, CWI, Amsterdam. Also appears as a chapter in S. Abramsky, D. Gabby and T. Maibaum (ed.) Handbook of Logic in Computer Science, Vol. 1, Oxford Press, 1992.
M.R.K. Krishna Rao, D. Kapur and R.K. Shyamasundar(1991), A Transformational Methodology for Proving termination of Logic Programs, Proc. Computer Science Logic, CSL'91, LNCS Vol. 626, Springer.
M.R.K. Krishna Rao (1992), Modular Proofs for Completeness of Hierarchical Systems, technical report, TIFR, Bombay, December 1992.
M. Kurihara and A. Ohuchi (1990), Modularity of Simple Termination of Term Rewriting Systems, Journal of IPS, Japan, Vol. 34, pp. 632–642.
M. Kurihara and A. Ohuchi (1992), Modularity of Simple Termination of Term Rewriting Systems with Shared Constructors, Theoretical Computer Science, Vol. 103, pp. 273–282.
A. Middeldorp (1989), A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting Systems, proc. LICS'89, pp. 396–401.
A. Middeldorp (1990), Modular Properties of Term Rewriting Systems, Ph.D. Thesis, Free University, Amsterdam.
A. Middeldorp and Y. Toyama (1991), Completeness of Combinations of Constructor Systems, proc. RTA'91, Springer LNCS Vol. 488, pp. 188–199.
E. Ohlebusch (1993), A Simple Proof of Sufficient Conditions for the Termination of Disjoint Union of Term Rewriting Systems, Bulletin of EATCS, Vol. 49, pp. 178–183.
M. Rusinowitch (1987), On Termination of the Direct Sum of Term Rewriting Systems, Information Processing Letters Vol. 26, pp. 65–70.
Y. Toyama (1987), OnChurch-Rosser Property for the Direct Sum of Term Rewriting Systems, JACM vol. 34, pp. 128–143.
Y. Toyama (1987), Counterexamples to Termination for the Direct Sum of Term Rewriting Systems, Information Processing Letters Vol. 25, pp. 141–143.
Y. Toyama, J.W. Klop and H.P. Barendregt (1989), Termination for the Direct Sum of Left-linear Term Rewriting Systems, proc. RTA'89, Springer LNCS Vol. 355, pp. 477–491.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rao, M.R.K.K. (1993). Completeness of hierarchical combinations of term rewriting systems. In: Shyamasundar, R.K. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1993. Lecture Notes in Computer Science, vol 761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57529-4_48
Download citation
DOI: https://doi.org/10.1007/3-540-57529-4_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57529-0
Online ISBN: 978-3-540-48211-6
eBook Packages: Springer Book Archive