1. Archer, M., G. Fink, and L. Yang: 1993, `Linking Other Theorem Provers to HOL using PM: Proof Manager’. In: L. Claesen and M. Gordon (eds.): Higher Order Logic Theorem Proving and its Applications: 4th International Workshop, HUG’92.
2. Ballarin, C., K. Homann, and J. Calmet: 1995, `Theorems and Algorithms: An Interface between Isabelle and Maple’. In: A. H. M. Levelt (ed.): International Symposium on Symbolic and Algebraic Computation. pp. 150–157.
3. Baumgartner, R and U. Furbach: 1994, `PROTEIN: A Prover with a Theory Extension Interface’. In: A. Bundy (ed.): Proc. 12th CADE, Nancy, France, Vol. 814 of LNCS. pp. 769–773.
4. Beckert, B.: 1994, `A Completion-Based Method for Mixed Universal and Rigid E-Unification’. In: A. Bundy (ed.): Proc. 12th CADE, Nancy, France, Vol. 814 of LNCS. pp. 678–692.
5. Beckert, B., R. Hähnle, R Oel, and M. Sulzmann: 1996, `The Tableau-Based Theorem Prover 3TAP, Version 4.0’. In: M. McRobbie and J. Slanley (eds.): Proc. 13th CADE, New Brunswick/NJ, USA, Vol. 1104 of LNCS. pp. 303–307.