1. Sten Agerholm, “Mechanizing Program Verification in HOL”, in Proceedings of the 1991 International Workshop on the HOL Theorem Proving System and its Applications, Davis, August 1991, edited by M. Archer, J. J. Joyce, K. N. Levitt, and P. J. Windley (IEEE Computer Society Press, 1992), pp. 208–222.
2. J. Camilleri and T. Melham, “Reasoning with Inductively Defined Relations in the HOL Theorem Prover”, Technical Report No. 265, University of Cambridge Computer Laboratory, August 1992.
3. Stephen A. Cook, “Soundness and Completeness of an Axiom System for Program Verification”, in SIAM Journal on Computing, Vol. 7, No. 1, February 1978, pp. 70–90.
4. G. Cousineau, M. Gordon, G. Huet, R. Milner, L. Paulson, and C. Wadsworth, The ML Handbook (INRIA, 1986).
5. Michael J. C. Gordon, “Mechanizing Programming Logics in Higher Order Logic”, in Current Trends in Hardware Verification and Automated Theorem Proving, ed. P.A. Subrahmanyam and Graham Birtwistle, Springer-Verlag, New York, 1989, pp. 387–439.