1. Avenhaus, J., Plaisted, D.: General algorithms for permutations in equational inference. Journal of Automated Reasoning 26, 223–268 (2001)
2. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
3. Babai, L.: Automorphism groups, isomorphism, reconstruction. In: Graham, R.L., Grotschel, M., Lovasz, L. (eds.) Handbook of Combinatorics, vol. 2, Elsevier and The MIT Press (1995)
4. Lecture Notes in Computer Science;H.P. Barendregt,1987
5. Boy de la Tour, T., Echenim, M.: On the complexity of deduction modulo leaf permutative equations. To appear in Journal of Automated Reasoning