Domain Theory in HOL

In this paper we present a formalization of domain theory in HOL. The notions of complete partial order, continuous function and inclusive predicate are introduced as semantic constants in HOL and fixed point induction is a derived theorem, just as we can derive other techniques for recursion. We provide tools which prove certain terms are cpos, continuous functions or inclusive predicates, automatically.