1. F. Baader and K. Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. In D. Kapur, editor, Proceedings of the Eleventh International Conference on Automated Deduction (Saratoga Springs, NY), volume 607 of Lecture Notes in Artificial Intelligence, Berlin, June 1992. Springer-Verlag.
2. F. Baader and K. Schulz. Combination of constraint solving techniques: An algebraic point of view. In Proceedings of the 6th International Conference on Rewriting Techniques and Applications, volume 914 of Lecture Notes in Artificial Intelligence, pages 352–366, Kaiserslautern, Germany, 1995. Springer Verlag.
3. F. Baader and K. Schulz. On the combination of symbolic constraints, solution domains, and constraint solvers. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP95, volume 976 of Lecture Notes in Artificial Intelligence, Cassis, France, 1995. Springer Verlag.
4. F. Baader and K. Schulz. Combination of constraint solvers for free and quasi-free structures. Theoretical Computer Science, 1998. To appear.
5. H. P. Barendregt. The Lambda Calculus, its Syntax and Semantics. North-Holland, Amsterdam, second edition, 1984.