1. H. P. Barendregt The Lambda Calculus. Its Syntax and Semantics. North-Holland Publ. Comp., Amsterdam, 1981.
2. D. B. Benson and I. Guessarian Algebraic solution to recursion schemata. Journal of Computer and System Sciences, 35:365–400, 1987.
3. N. Dershowitz and J.-P. Jouannaud Rewrite systems. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 6, pages 243–320. Elsevier-MIT Press, Amsterdam, New York, Oxford, Tokyo, 1990.
4. J. P. Gallier and W. Snyder Designing unification procedures using transformations: A survey. Bulletin of the European Association for Theoretical Computer Science, 40:273–326, February 1990.
5. G. Huet and D. C. Oppen Equations and rewriting rules: A survey. In Formal Language Theory: Perspectives and Open Problems, pages 349–405. Academic Press, New York, 1980.