FstarA Proof-oriented Programming Language
LeanHomepage
Theorem Proving in Lean
FAQ
CoqCoq is a formal proof management system. It provides a formal language to write mathematical definitions, executable algorithms and theorems together with an environment for semi-interactive development of machine-checked proofs.
Set-TheoryCoq encoding of ZFC and formalization of the textbook Elements of Set Theory
LinearOneLinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.
archsatA proof-producing SMT/McSat solver, handling polymorphic first-order logic, and using an SMT/McSat core extended using Tableaux, Superposition and Rewriting.
gaptGAPT: General Architecture for Proof Theory
fm-notesUnassorted scribbles on formal methods, type theory, category theory, and so on, and so on
ostrichAn SMT Solver for string constraints
Leo-IIIAn Automated Theorem Prover for Classical Higher-Order Logic with Henkin Semantics
awesome-rust-formalized-reasoningAn exhaustive list of all Rust resources regarding automated or semi-automated formalization efforts in any area, constructive mathematics, formal algorithms, and program verification.
pomagmaAn inference engine for extensional untyped λ-calculus
gidtiBook: Gentle Introduction to Dependent Types with Idris
rusty-razorRazor is a tool for constructing finite models for first-order theories
pyproverResolution theorem proving for predicate logic in pure Python.