Search Results for "theorem prover"

DeepSeek-Prover-V2 is DeepSeek’s specialized model for formal theorem proving, particularly targeting proof in Lean 4. The repository describes how they use recursive proof decomposition by prompting DeepSeek-V3 to break complex theorems into subgoals, synthesize proof sketches, and then combine them to bootstrap training data. They then fine-tune via reinforcement learning with binary correct/incorrect feedback to integrate informal reasoning with formal proof behavior. ...

Lean 4 is both a programming language and an interactive theorem prover, designed to support formal reasoning while also functioning as an efficient and extensible general-purpose language. The project serves researchers, mathematicians, programmers, and formal methods users who need a system for writing machine-checked proofs as well as executable programs in the same environment. One of its defining characteristics is its emphasis on extensibility, since Lean 4 is built to allow users to develop custom automation, metaprogramming tools, and domain-specific extensions instead of being limited to a fixed proving workflow. ...

Agda is a dependently typed, total functional programming language and interactive theorem prover based on Martin-Löf’s type theory. It allows expressing programs and proofs in the same language, using the Curry–Howard correspondence. It features interactive development via Emacs, Atom, or VS Code. Agda is a dependently typed functional programming language. It has inductive families, i.e., data types which depend on values, such as the type of vectors of a given length. ...

The Archive of Formal Proofs is a collection of proof libraries, examples, and larger scientifc developments, mechanically checked in the theorem prover Isabelle. It is organized in the way of a scientific journal. Submissions are refereed.

CTL-RP stands for Computation Tree Logic Resolution Prover. Computation Tree Logic (CTL) is a branching-time temporal logic. CTL-RP is a resolution based theorem prover for CTL, which utilises a first-order theorem prover, SPASS, as a core engine for inference. Please see the following link for more details. http://cueb.science/web/software/ (if you are inside China.) http://ctlrp.sourceforge.net (if you are not inside China.)

semantic research toolkits theorem prover, plus journalized term system

IsaPlanner is a collection of reasoning tools: a proof planner for Isabelle, implementing a Rippling based inductive theorem prover; theory synthesis tools for Isabelle; an open-graph based tool for reasoning about quantum information (quantomatic);

The animation of algorithmic rule systems based on the Isabelle theorem prover.

Type checker and (eventually) theorem prover for the Z specification language.

A theorem prover for IKL, a very expressive ontology language. Status: This project is pre-alpha.

This page contains tools for applying automated reasoning to Bluespec SystemVerilog (BSV) hardware designs. We provide code for importing BSV designs into the PVS theorem prover and the SAL model checker.

Belle is a generic higher order theorem prover in the style of Isabelle.

An ML-based automated theorem prover for propositional logic making use of an algorithm in the intercalation calculus.

The Eagle automated theorem prover is a system for developing proofs for theorems in predicate logic.

HyLoRes is a resolution based automated theorem prover for hybrid logics, developed in Haskell.

Athena is an interactive theorem prover, liberated from the "proofs are types" dogma!

This project will develop a graphical front-end environment using Java for a First Order Logic theorem prover called Otter. Otter is a free scientific tool that is open source, written in C, and command line only. It will support Linux, OSX, and Win

Spassgui is a Perl/Tk based Gui for SPASS (An Automated Theorem Prover for First-Order Logic with Equality) by http://spass.mpi-sb.mpg.de .

Automated Theorem Prover implemented in Java and using clause trees. This software will be able to read mathematical theorems from TPTP and prove or disprove them.

ManTa is an equational specification language and tools to support it: theorem prover, code generators (C and Ocaml), frontends.

A beginners' level theorem prover project for logic students. Okitsune is written in Haskell and open for contributions.

...In our C like programming language named "SimPL" you can easily and simply annotate your code with preconditions and assertions (also with forall and exists expressions). We then use Microsofts Z3 theorem prover to prove if the behaviour of your program matches what you expected. The easy to use GUI with an integrated Interpreter and Debugger (with a Stackview and HotCodeReplacement) makes it even easier to write your code and find errors. This project has been developed during a University project called PSE ("Praxis der Softwareentwicklung" / "practical experience in software developement") at the Karlsruhe Institute of Technology (KIT) by Andreas Eberle, Nicolas Loza, Olga Plisovskaya, Andreas Waidler and Michael Zangl. ...