% \addcontentsline{toc}{chapter}{Bibliography}

\begin{thebibliography}{99}

\bibitem{UA} Burris, Stanley and Sankappanavar, H.~P.,
{\it A Course in Universal Algebra,}
Springer-Verlag, 1981.

\bibitem{Church40} Church, A.,
A Formulation of the Simple Theory of Types,
{\it Journal of Symbolic Logic} {\bf 5}, (1940), 56--68.

\bibitem{ML} Cousineau, G., G.~Huet, and L.~Paulson,
{\it The ML Handbook,}
INRIA, 1986

\bibitem{Gordon87} Gordon, M.~J.~C.,
HOL: A Proof Generating System for Higher-Order Logic,
{\it VLSI Specification, Verification and Synthesis,}
edited by G.~Birtwistle and P.~A.~Subrahmanyam,
Kluwer International Series in Engineering and Computer Science,
Kluwer Academic Publishers, 1988, 73--128.

\bibitem{Herstein} Herstein, I.~N.,
{\it Topics in Algebra\/} $2^{\rm nd}$ edition,
Xerox College Publishing, 1975.

\bibitem{Huppert} Huppert, B.,
{\it Endliche Gruppen I,}
Springer-Verlag, 1983.

\bibitem{Melham88} Melham, Thomas F.,
Automating Recursive Type Definitions in Higher Order Logic,
Technical Report No.~146
University of Cambridge Computer Laboratory,
September 1988.

\bibitem{Paulson87} Paulson, Laurence C.,
{\it Logic and Computation: Interactive Proof with Cambridge LCF,}
Caridge Tracts in Theoretical Computer Science 2,
Cambridge University Press, 1987.

\end{thebibliography}
