Live Online Classes in Design, Coding & AI — Small Classes, Free Retakes
The Fastest Way to Become a Backend Developer Online
Overview
AI, Data Science & Cloud Certificates from Google, IBM & Meta — 40% Off
One plan covers every Professional Certificate on Coursera. 40% off Coursera Plus Annual.
Unlock All Certificates
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.
Syllabus
[CPP'26] A Lambda-Superposition Tactic for Isabelle/HOL
Taught by
ACM SIGPLAN