Abstract
A term rewriting system is strongly innermost normalizing if every innermost derivation of it is of finite length. This property is very important in the integration of functional and logic programming paradigms. Unlike termination, strong innermost normalization is not preserved under subsystems, i.e., every subsystem of a strongly innermost normalizing need not be strongly innermost normalizing. Preservation of a property under subsystems is important in analyzing systems in a modular fashion. In this paper, we identify a few classes of TRSs which enjoy this property. These classes are of particular interest in studying modularity of composable and hierarchical combinations. It is also proved that the choice of the innermost redex to be reduced at any step has no bearing on termination (finiteness) of innermost derivations. It may be noted that such selection invariance does not hold for outermost derivations. The proof techniques used are novel and involve oracle based reasoning -which is very sparsely used in the rewriting literature.
On leave from Tata Institute of Fundamental Research, Bombay. The work was partially carried out at TIFR.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
T. Arts and H. Zantema (1994), Termination of logic programs via labelled term rewrite systems, Tech Rep. Utrecht University.
N. Dershowitz and J.-P. Jouannaud (1990), Rewrite Systems, in J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. B, pp. 243–320, North-Holland.
B. Gramlich (1995), Abstract relations between restricted termination and confluence properties of rewrite systems, Fundamenta Informaticae 24, pp. 3–23.
M. Hanus (1994), The integration of functions into logic programming: a survey, J. Logic Prog. 19/20, pp. 583–628.
J.W. Klop (1992), Term Rewriting Systems, in S. Abramsky, D. Gabbay and T. Maibaum (ed.), Handbook of Logic in Computer Science, Vol. 2, Oxford Press.
M.R.K. Krishna Rao, D. Kapur and R.K. Shyamasundar (1991), A Transformational methodology for proving termination of logic programs, Proc. of Computer Science Logic, CSL'91, LNCS 626, pp. 213–226, Springer-Verlag.
M.R.K. Krishna Rao (1993), Completeness of hierarchical combinations of term rewriting systems, Proc. of FST&TCS'93, LNCS 761, pp. 125–138, Springer-Verlag. Revised version appears as Modular proofs for completeness of hierarchical systems, Theoretical Computer Science 151, pp. 487–512.
M.R.K. Krishna Rao (1994), Simple termination of hierarchical combinations of term rewriting systems, Proc. of TACS'94, LNCS 789, pp. 203–223, Springer-Verlag.
M.R.K. Krishna Rao (1995), Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems, Proc. of TAPSOFT'95, LNCS 915, pp. 379–393, Springer-Verlag.
A. Middeldorp and Y. Toyama (1993), Completeness of combinations of constructor systems, J. Symb. Comp. 15, pp. 331–348.
E. Ohlebusch (1994), Modular properties of composable term rewriting systems, Ph.D. Thesis, Univ of Bielefeld.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rao, M.R.K.K. (1996). Some characteristics of strong innermost normalization. In: Wirsing, M., Nivat, M. (eds) Algebraic Methodology and Software Technology. AMAST 1996. Lecture Notes in Computer Science, vol 1101. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014330
Download citation
DOI: https://doi.org/10.1007/BFb0014330
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61463-0
Online ISBN: 978-3-540-68595-1
eBook Packages: Springer Book Archive