This paper describes an interface between the CLAM proof planner and the HOL interactive theorem prover. The interface sends HOL goals to CLAM for planning, and translates plans back into HOL tactics that solve the initial goals. The combined system is able to automatically prove a number of theorems involving recursively defined functions.
['Richard J. Boulton', 'Konrad Slind', 'Alan Bundy', 'Michael J. C. Gordon']
An Interface between Clam and HOL