1. S. Agerholm. Formalising a model of the λ-calculus in HOL-ST. Technical Report 354, University of Cambridge Computer Laboratory, November 1994.
2. S. Agerholm. A HOL Basis for Reasoning about Functional Programs. PhD thesis, BRICS, Department of Computer Science, University of Aarhus, December 1994. Available as Technical Report RS-94-44.
3. S. Agerholm. A comparison of HOL-ST and Isabelle/ZF. Technical Report 369, University of Cambridge Computer Laboratory, 1995.
4. D. Cantone, A. Ferro, and E. Omodeo, editors. Computable Set Theory, volume 1. Clarendon Press, Oxford, 1989.
5. R. L. Constable et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, 1986.