Tag
A hands-on blog post comparing four theorem provers—Lean, Isabelle/HOL, HOL4, and Agda—by formalizing Euclid's proof of the infinitude of primes in each, with opinionated rankings on usability, interactivity, and enjoyment.
Lawrence Paulson discusses a bogus refutation of the Collatz conjecture caused by a bug in the Lean kernel, reflecting on proof objects and soundness in proof assistants.
Galois announces that SAW now supports generating Isabelle theories from Cryptol specifications, bridging the usability of Cryptol and SAW with the expressivity of interactive theorem provers like Isabelle, enabling semi-automated verification of cryptographic protocols.