Boyer-Moore Automation for the HOL System

Abstract Boyer and Moore's heuristics for their first-order logic without quantifiers have been re-implemented in the HOL system. They have been adapted to behave as an automatic prover for the subset of higher-order logic that roughly corresponds to the Boyer-Moore logic. This paper describes the modifications required and presents some initial results and conclusions from the exercise.