Improving automation in interactive theorem provers by efficient encoding of lambda-abstractions
Hammers are tools for empolying external automatic theorem provers (ATPs) to improve automation in formal proof assistants. Strong automation can greatly ease the task of developing formal proofs. An essential component of any hammer is the translation of the logic of a proof assistant to the format of an ATP. Formalisms of state-of-the-art ATPs are usually first-order, so some method for eliminating lambda-abstractions is needed. We present an experimental comparison of several combinatory abstraction algorithms for HOL(y)Hammer – a hammer for HOL Light. The algorithms are compared on the HOL Light standard library extended with a library for multivariate analysis. We succeeded in developing algorithms which outperform both lambda-lifting and the simple Schonfinkel’s algorithm used in Sledgehammer for Isabelle/HOL. This visibly improves the ATPs’ success rate on translated problems, thus enhancing automation in proof assistants.
Mon 18 Jan Times are displayed in time zone: (GMT-05:00) Guadalajara, Mexico City, Monterrey change
|14:00 - 14:30|
|14:30 - 15:00|
Lukasz CzajkaUniversity of Innsbruck
|15:00 - 15:30|