1. Bachmair, L.: Proof by consistency in equational theories. In Proc. 3rd IEEE Symp. Logic in Computer Science, Edinburgh, July 1988
2. Bert, D., Echahed, R.: Design and implementation of a generic, logic and functional programming language. In: Proc. ESOP 86, Saarbrücken. Lecture Notes in Computer Sciences, vol. 213. Berlin, Heidelberg, New York: Springer, March 1986. Available as IMAG Research Report 560
3. Bogaert, B.: Automates d'arbres avec tests d'régalités. PhD thesis, Université des Sciences et Techniques de Lille Flandres-Artois, December 1990
4. Bürckert, H.J.: Solving disequations in equational theories. In: Proc. 9th Conf. on Automated Deduction, Argonne. Lecture Notes in Computer Sciences, vol. 310. Berlin, Heidelberg, New York: Springer, May 1988
5. Colmerauer, A.: Equations and inequations on finite and infinite trees. In: FGCS'84 Proceedings, pages 85?99, November 1984