On equivalence transformations for term rewriting systems
This paper proposes some simple methods, based on the Church-Rosser property, for testing the equivalence in a restricted domain of two reduction systems. Using the Church-Rosser property, sufficient conditions for the equivalence of abstract reduction systems are proved. These conditions can be effectively applied to test the equivalence in a restricted domain of term rewriting systems. In addition, equivalence transformation rules for term rewriting systems are proposed.
Unable to display preview. Download preview PDF.
- Barendregt,H.P.:" The lambda calculus, its syntax and semantics", North-Holland (1981).Google Scholar
- Goguen, J.A.:" How to prove algebraic inductive hypotheses without induction, with applications to the correctness of data type implementation", Proc. 5th Conf. Automated deduction, Les Arcs (1980).Google Scholar
- Huet,G. and Oppen,D.C.:" Equations and rewrite rules: a survey", Formal languages: perspectives and open problems, Ed.Book,R., Academic Press (1980), pp.349–393.Google Scholar
- Klop,J.W.:" Combinatory reduction systems", Dissertation, Univ. of Utrecht (1980).Google Scholar
- Knuth,D.E. and Bendix,P.G.:" Simple word problems in universal algebras", Computational problems in abstract algebra, Ed.Leech,J., Pergamon Press (1970), pp.263–297.Google Scholar
- Musser,D.R.:" On proving inductive properties of abstract data types", Proc. 7th ACM Sympo. Principles of programming languages (1980), pp.154–162.Google Scholar
- O'Donnell,M.:" Computing in systems described by equations", Lecture Notes in Comput. Sci. Vol.58, Springer-Verlag (1977).Google Scholar
- Scherlis,W.L.:" Expression procedures and program derivation", Ph.D.thesis, Stanford Computer Science Report STAN-CS-80-818 (1980).Google Scholar
- Toyama, Y.:" On commutativity of term rewriting systems ", Trans. IECE Japan, J66-D, 12, pp.1370–1375 (1983).Google Scholar