Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Learn about a new automated theorem proving tactic for Isabelle/HOL in this 22-minute conference presentation from CPP 2026. Discover the slam tactic, an innovative automated theorem prover built on the λ-superposition calculus that directly targets higher-order logic without requiring translation to first-order logic. Explore how this approach offers an alternative to Isabelle's existing metis tactic by eliminating translation overhead and maintaining native higher-order reasoning capabilities. Understand the integration of slam as a Sledgehammer backend for reconstructing proofs generated by external higher-order automated theorem provers including E, Vampire, and Zipperposition. Examine the technical foundations of λ-superposition calculus and its application to interactive theorem proving environments. Gain insights into advances in automatic theorem proving techniques and their practical implementation within the Isabelle/HOL proof assistant framework.
