1. Termination of term rewriting using dependency pairs
2. H. P. Barendregt.The Lambda Calculus, Its Syntax and Semantics, volume 103 ofStudies in Logic and the Foundation of Mathematics. Elsevier, 1984.
3. H. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. Available at \texttthttp://www.grappa.univ-lille3.fr/tata, 2007.
4. The Coq Proof Assistant. Available at http://coq.inria.fr/.
5. Grundlagen der Kombinatorischen Logik