Department of Computer Science and Technology

Technical reports

A comparison of HOL-ST and Isabelle/ZF

Sten Agerholm

July 1995, 23 pages

DOI: 10.48456/tr-369


The use of higher order logic (simple type theory) is often limited by its restrictive type system. Set theory allows many constructions on sets that are not possible on types in higher order logic. This paper presents a comparison of two theorem provers supporting set theory, namely HOL-ST and Isabelle/ZF, based on a formalization of the inverse limit construction of domain theory; this construction cannot be formalized in higher order logic directly. We argue that whilst the combination of higher order logic and set theory in HOL-ST has advantages over the first order set theory in Isabelle/ZF, the proof infrastructure of Isabelle/ZF has better support for set theory proofs than HOL-ST. Proofs in Isabelle/ZF are both considerably shorter and easier to write.

Full text

PDF (1.8 MB)

BibTeX record

  author =	 {Agerholm, Sten},
  title = 	 {{A comparison of HOL-ST and Isabelle/ZF}},
  year = 	 1995,
  month = 	 jul,
  url = 	 {},
  institution =  {University of Cambridge, Computer Laboratory},
  doi = 	 {10.48456/tr-369},
  number = 	 {UCAM-CL-TR-369}