1. Handbook of Logic in Computer Science;Abramsky,1992
2. Term Rewriting and All That;Baader,1998
3. The Lambda Calculus, Its Syntax and Semantics;Barendregt,1984
4. Church–Rosser strategies in the lambda calculus;Bergstra;Theoret. Comput. Sc.,1979
5. Comon, H, Dauchet, M, Gilleron, R, Lugiez, D, Tison, S, and, Tommasi, M. 1997, Tree Automata Techniques and Applications, available at, http://www.grappa.univ-lille3.fr/tata.