Lean 4 is a reimplementation of the Lean interactive theorem prover (ITP) in Lean itself. It
addresses many shortcomings of the previous versions and contains many new features …

Lean is a new open source theorem prover being developed at Microsoft Research and
Carnegie Mellon University, with a small trusted kernel based on dependent type theory. It …

Both logic programming in general and Prolog in particular have a long and fascinating
history, intermingled with that of many disciplines they inherited from or catalyzed. A large …

The Abella interactive theorem prover is based on an intuitionistic logic that allows for
inductive and co-inductive reasoning over relations. Abella supports the λ-tree approach to …

Many languages are beginning to integrate dynamic and static ty**. Siek and Taha offered
gradual ty** as an approach to this integration that provides a coherent and full-span …

It is nowadays customary to organize libraries of machine checked proofs around
hierarchies of algebraic structures [2, 6, 8, 16, 18, 23, 27]. One influential example is the …

We present a new interpreter for λ Prolog that runs consistently faster than the byte code
compiled by Teyjus, that is considered the best available implementation of λ Prolog. The …

The subject of this thesis is the proof theory of logics with fixed points, such as the μ-
calculus, linear-logic with fixed points, etc. These logics are usually equipped with finitary …

Early efforts to formalize mathematics in order to make parts of it more rigorous and to show
its consistency started with the codification of parts of logic. There was work on the logical …

We extend proof automation in an interactive theorem prover to analyze changes in
specifications and proofs. Our approach leverages the history of changes to specifications …