1. Amjad, H.: Programming a symbolic model checker in a fully expansive theorem prover. In: Theorem Proving in Higher Order Logics (TPHOLs). 16th International Conference, Proceedings. LNCS, vol. 2758, pp. 171–187. Springer, New York (2003)
2. Arthan, R., Bishop-Jones, R.: Z in Hol in ProofPower, pp. 387–439. FACS FACTS (2005)
3. Boulton, R., Gordon, A., Gordon, M., Harrison, J., Herbert, J., Van Tassel, J.: Experience with embedding hardware description languages in HOL. In: Stavridou, V., Melham, T.F., Boute, R.T. (eds.) Proceedings of the IFIP TC10/WG 10.2 International Conference on Theorem Provers in Circuit Design: Theory, Practice and Experience (Nijmegen, The Netherlands) IFIP Transactions, vol. A-10, pp. 129–156. Elsevier, Amsterdam (1992)
4. Boulton, R., Slind, K., Bundy, A., Gordon, M.: An interface between Clam and HOL. In: Grundy, J., Newey, M. (eds.) Theorem Proving in Higher Order Logics. 11th International Conference, TPHOLs’98 (Canberra). Lecture Notes in Computer Science, no. 1479, pp. 87–104. Springer, New York (1998)
5. Boulton, R.: Efficiency in a fully-expansive theorem prover. Ph.D. thesis, Tech. Report 337, University of Cambridge Computer Laboratory (1994)