Part of the Lecture Notes in Computer Science book series (LNCS, volume 355)
Modular aspects of properties of term rewriting systems related to normal forms
In this paper we prove that the property of having unique normal forms is preserved under disjoint union. We show that two related properties do not exhibit this kind of modularity.
KeywordsEquivalence Class Normal Form Function Symbol Reduction Rule Conservative Extension
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.
Unable to display preview. Download preview PDF.
- A. Middeldorp, A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting Systems, Report IR-150, Vrije Universiteit Amsterdam, 1988. To appear in: Proceedings of the 4th Conference on Logic in Computer Science (Asilomar, 1989).Google Scholar
- A. Middeldorp, Modular Aspects of Properties of Term Rewriting Systems Related to Normal Forms, Report IR-164, Vrije Universiteit Amsterdam, 1988.Google Scholar
- M. Rusinowitch, On Termination of the Direct Sum of Term Rewriting Systems, Information Processing Letters 26, pp. 65–70, 1987.Google Scholar
- Y. Toyama, On the Church-Rosser Property for the Direct Sum of Term Rewriting Systems, Journal of the ACM 34(1), pp. 128–143, 1987.Google Scholar
- Y. Toyama, Counterexamples to Termination for the Direct Sum of Term Rewriting Systems, Information Processing Letters 25, pp. 141–143, 1987.Google Scholar
- Y. Toyama, J.W. Klop and H.P. Barendregt, Termination for the Direct Sum of Left-Linear Term Rewriting Systems, in this proceedings.Google Scholar
© Springer-Verlag Berlin Heidelberg 1989