1. Bachmair, L., Dershowitz, N.: Critical pair criteria for completion. J. Symbolic Computation 6(1), 1–18 (1988)
2. Rewriting Techniques;L. Bachmair,1989
3. Barendregt, H.: The Lambda Calculus, its Syntax and Semantics, 2nd edn. North-Holland, Amsterdam (1984)
4. Bertrand, A.: Sur une conjecture d’YvesMétivier. Theoretical Computer Science 123(1), 21–30 (1994)
5. Bezem, M., Coquand, T.: Newman’s Lemma – a case study in proof automation and geometric logic (Logic in Computer Science Column). Bulletin of the EATCS 79, 86–100 (2003)