1. Bezem, M., Coquand, T.: Newman’s lemma—a case study in proof automation and geometric logic. In: Păun, G., Rozenberg, G., Salomaa, A. (eds.) Current Trends in Theoretical Computer Science, vol. 2, pp. 267–282. World Scientific, Singapore (2004)
2. Bezem, M., Coquand, T.: Automating coherent logic. In: Sutcliffe, G., Voronkov, A. (eds.) Proceedings LPAR-12. Lecture Notes in Computer Science, vol. 3825, pp. 246–260. Springer-Verlag, Berlin (2005)
3. Bezem, M., Hendriks, D.: Web page including CL tool, input files, Coq files. http://www.cs.vu.nl/~diem/research/ht/ .
4. Bezem, M., Hendriks, D., de Nivelle, H.: Automated proof construction in type theory using resolution. J. Autom. Reason. 29(3), 253–275 (2002)
5. Bonichon, R., Delahaye, D., Doligez, D.: Zenon: an extensible automated theorem prover producing checkable proofs. In: Dershowitz, N., Voronkov, A. (eds.) Proceedings LPAR-14. Lecture Notes in Computer Science, vol. 4790, pp. 151–165. Springer-Verlag, Berlin (2007)