1. Aho, A. V., Hopcroft, J. E. and Ullman, J. D.: “Data Structures and Algorithms” (Addison-Wesley) (1983).
2. Baxter, L. D.: “A Practically Linear Unification Algorithm,” Report,CS-76-13 (Department of Computer Science, University of Waterloo) (February, 1976).
3. Corbin, J. and Bidoit, M.: “A Rehabilitation of Robinson’s Unification Algorithm,” Information Processing 83, R. E. A. Mason (ed.) (Elsevier Science Publishers) (September, 1983) 909–914.
4. Colmerauer, A.: “Prolog and Infinite Trees,” in Logic Programming, K. L. Clark and S-Å. Tärnlund (eds.) (Academic Press) (1982) 231–251.
5. Courcelle, B.: “Fundamental Properties of Infinite Trees,” Theoretical Computer Science,25(1983) 95–169.