On equivalence transformations for term rewriting systems

  • Yoshihito Toyama
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 220)


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.

Unable to display preview. Download preview PDF.


  1. [1]
    Barendregt,H.P.:" The lambda calculus, its syntax and semantics", North-Holland (1981).Google Scholar
  2. [2]
    Burstall, R.M. and Darlington, J.:" A transformation system for developing recursive programs", J.ACM, Vol.24 (1977), pp.44–67.CrossRefGoogle Scholar
  3. [3]
    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
  4. [4]
    Huet, G.:" Confluent reductions: abstract properties and applications to term rewriting systems", J.ACM, Vol.27 (1980), pp.797–821.CrossRefGoogle Scholar
  5. [5]
    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
  6. [6]
    Huet, G. and Hullot, J.M.:" Proofs by induction in equational theories with constructors", J. Comput. and Syst.Sci., Vol.25 (1982), pp.239–266.CrossRefGoogle Scholar
  7. [7]
    Klop,J.W.:" Combinatory reduction systems", Dissertation, Univ. of Utrecht (1980).Google Scholar
  8. [8]
    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
  9. [9]
    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
  10. [10]
    O'Donnell,M.:" Computing in systems described by equations", Lecture Notes in Comput. Sci. Vol.58, Springer-Verlag (1977).Google Scholar
  11. [11]
    Rosen, B.K.:" Tree-manipulating systems and Church-Rosser theorems", J.ACM, Vol 20 (1973), pp.160–187.CrossRefGoogle Scholar
  12. [12]
    Scherlis,W.L.:" Expression procedures and program derivation", Ph.D.thesis, Stanford Computer Science Report STAN-CS-80-818 (1980).Google Scholar
  13. [13]
    Toyama, Y.:" On commutativity of term rewriting systems ", Trans. IECE Japan, J66-D, 12, pp.1370–1375 (1983).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Yoshihito Toyama
    • 1
  1. 1.Musashino Electrical Communication Laboratory, N.T.T. Midori-choMusashino-shiJapan

Personalised recommendations