1. Lect Notes Comput Sci;A.C. Caron,1999
2. H. Comon, M. Dauchet, R. Gilleron, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications (TATA). http://l3ux02.univ-lille3.fr/tata .
3. L. Fribourg. SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting. In proceedings IEEE Symposium on Logic Programming, pages 172–185, Boston, 1985.
4. Lect Notes Comput Sci;V. Gouranton,2001
5. M. Hermann and R. Galbavý. Unification of Infinite Sets of Terms Schematized by Primal Grammars. Theoretical Computer Science, 176, 1997.