1. McCarty J., Recursive functions of symbolic expressions and their computation by machine. Part I, Comm. ACM, 3, 1960, 184.
2. Rosen B.K., Tree-Manipulating Systems and Church-Rosser Theorems, ACM Journal, 20, 1973, 160.
3. Knuth D.E. and Bendix P.E., Simple word problems in universal algebras, in Computational problems in Abstract Algebra, Leech J., Pergamon Press, Braunschweig, 1970, 263.
4. Manna Z., Ness S. and Vuillemin J., Inductive methods for proving properties of programs, in Proceedings of an ACM Conference on Proving Assertions about Programs, Las Cruces, 1972, 27.
5. De Michelis G., Recursive functions not dependent on the computation rules, in Proceedings of International Computing Symposium 1973, Davos, 1973.