1. P. B. Andrews, M. Bishop, S. Issar, D. Nesmith, F. Pfenning, and H. Xi. TPS: A theorem proving system for classical type theory. Research report 94–166, Department of Mathematics, Carnegie-Mellon University, 1994.
2. Anonymous. The QED Manifesto. In A. Bundy, editor, 12th International Conference on Automated Deduction, volume 814 of Lecture Notes in Computer Science, pages 238–251, Nancy, France, 1994. Springer-Verlag.
3. M. Archer, J. J. Joyce, K. N. Levitt, and P. J. Windley, editors. Proceedings of the 1991 International Workshop on the HOL theorem proving system and its Applications, University of California at Davis, Davis CA, USA, 1991. IEEE Computer Society Press.
4. B. Beckert and J. Posegga. leanT A P: Lean, tableau-based deduction. Journal of Automated Reasoning, 15:339–358, 1995. Available on the Web from ftp://sonja.ira.uka.de/pub/posegga/LeanTaP.ps.Z.
5. P. E. Black and P. J. Windley. Automatically synthesized term denotation predicates: A proof aid. In P. J. Windley, T. Schubert, and J. Alves-Foss, editors, Higher Order Logic Theorem Proving and Its Applications: Proceedings of the 8th International Workshop, volume 971 of Lecture Notes in Computer Science, pages 46–57, Aspen Grove, Utah, 1995. Springer-Verlag.