B. Barras, The Coq Proof Assistant Reference Manual Version 6.3.1. INRIA-Rocquencourt, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00069968

Y. Coscoy, A natural language explanation for formal proofs, Proceedings of Int. Conf. on Logical Aspects of Computational Liguistics (LACL), vol.1328, 1996.

R. Di and C. , Isomorphisms of Types: from ?-calculus to information retrieval and language design, Progress in Theoretical Computer Science, 1995.

R. Dyckho, Contraction-free sequent calculi for intuitionistic logic, The Journal of Symbolic Logic, vol.57, 1992.

M. J. Gordon and T. F. Melham, Introduction to HOL: a Theorem Proving Environment for Higher Order Logic, 1993.

, This can be seen as a step towards a bootstrapped system

M. J. Gordon, R. Milner, and C. P. Wadsworth, Edinburgh LCF: a mechanised logic of computation, Lectures Notes in Computer Science, vol.78, 1979.

J. Harrison, Proof style, Types for Proofs and Programs: International Workshop TYPES'96, p.154172, 1996.

X. Leroy, The Objective Caml system release 3.00. INRIA-Rocquencourt, 2000.

C. Muñoz, Démonstration automatique dans la logique propositionnelle intuitionniste, 1994.

S. Owre, N. Shankar, and J. Rushby, PVS: A prototype verication system, Proceedings of CADE 11, 1992.

D. Syme, Declarative Theorem Proving for Operational Semantics, 1998.

A. Trybulec, The Mizar-QC/6000 logic information language, ALLC Bulletin (Association for Literary and Linguistic Computing), vol.6, p.136140, 1978.