Isabelle-extreme Link

(* Prove a simple property manually – no automation! ) lemma add_zero: "add 0 m = m" unfolding add_def by (rule fix_eq) ( primitive rule only *)

Notice: no simp , no induct . Every proof step must explicitly invoke a primitive inference rule. isabelle-extreme

Also known as (EXperimental TRansformational Equational Mathematics Engine), this is not a new front-end or library. It is a radically stripped-down meta-logic – the absolute minimal core needed to perform interactive proofs within the Isabelle framework. (* Prove a simple property manually – no automation

Most people in the formal verification community are familiar with – the powerful, mainstream interactive theorem prover used for everything from operating system kernels (seL4) to financial protocols. But lurking in the source tree and early development history is a hidden gem: isabelle-extreme . But lurking in the source tree and early

isabelle-extreme is the "assembly language" of the Isabelle ecosystem – raw, unforgiving, and beautiful in its simplicity. While you will never ship a verified compiler written in it, exploring it offers a rare glimpse into the foundational bedrock on which massive proof developments rest.