Interactive proof assistants should verify the proofs they receive from automatic theorem
provers. Normally this proof reconstruction takes place internally, forming part of the …

Interactive theorem provers can model complex systems, but require much effort to prove
theorems. Resolution theorem provers are automatic and powerful, but they are designed to …

Interactive theorem provers have developed dramatically over the past four decades, from
primitive beginnings to today's powerful systems. Here, we focus on Isabelle/HOL and its …

We present a generic approach to readable formal proof documents, called Intelligible semi-
automated reasoning (Isar). It addresses the major problem of existing interactive theorem …

Interactive theorem provers require too much effort from their users. We have been
developing a system in which Isabelle users obtain automatic support from automatic …

A step-by-step presentation of the code for a small theorem prover introduces theorem-
proving techniques. The programming language used is Standard ML. The prover operates …

We propose a synthesis of the two proof styles of interactive theorem proving: the procedural
style (where proofs are scripts of commands, like in Coq) and the declarative style (where …

The Isabelle system essentially provides a generic infrastructure for building deductive
systems (programmed in Standard ML), with a special focus on interactive theorem proving …

Interactive theorem proving has grown from toy examples to major projects formalizing
mathematics and verifying software, and there is now a critical need for theory engineering …

We describe a tutorial that demonstrates the use of the ACL2 theorem prover. We have three
goals: to enable a motivated reader to start on a path towards effective use of ACL2; to …