IBM / FormalMLLinks
Formalization of Machine Learning Theory with Applications to Program Synthesis
☆78Updated last month
Alternatives and similar repositories for FormalML
Users that are interested in FormalML are comparing it to the libraries listed below
Sorting:
- SampCert : Verified Differential Privacy☆84Updated 7 months ago
- An open bibliography of machine learning for formal proof papers☆32Updated 2 years ago
- Experiments with some ways of automating reasoning in lean 4☆17Updated last year
- Pedagogical first-order prover in Python☆77Updated 5 months ago
- Python bindings for the Coq interactive proof assistant☆57Updated 3 years ago
- Materials for the course "theorem prover lab: applications in programming languages" at KIT, SS2021 edition☆51Updated 4 years ago
- ☆22Updated 2 years ago
- Logic and Mechanized Reasoning☆112Updated last month
- coq-synthesis is a Coq plugin for proof generation and next tactic prediction☆13Updated last year
- Bonn Lean course for winter 24/25☆37Updated 3 months ago
- An automatic theorem prover in OCaml for typed higher-order logic with equality and datatypes, based on superposition+rewriting; and Logt…☆151Updated last year
- Experiments with SAT solvers with proofs in Lean 4☆62Updated last year
- ☆24Updated 2 weeks ago
- Verifying encodings into propositional logic in Lean☆12Updated 2 years ago
- Dafny-VMC: a Library for Verified Monte Carlo Algorithms☆17Updated last year
- ☆16Updated 4 years ago
- Implementation of higher-order logic in Python☆65Updated 2 years ago
- Tools based on AI for helping with Lean 4☆106Updated last week
- ☆117Updated this week
- A Seamless, Interactive Tactic Learner and Prover for Coq☆77Updated last week
- KeYmaera X: An aXiomatic Tactical Theorem Prover for Hybrid Systems (release)☆85Updated this week
- Python talking to the Lean theorem prover☆46Updated 4 years ago
- The TacTok automated Coq proof script synthesis tool☆17Updated last year
- ☆63Updated this week
- ☆71Updated 2 weeks ago
- Automatic theorem proving via natural language reasoning with LLMs☆18Updated 6 months ago
- Probabilistic separation logics for verifying higher-order probabilistic programs.☆31Updated this week
- Formalizing convex polyhedra in Coq☆24Updated last year
- ☆16Updated 4 years ago
- This package provides an interface and foundation for verified SAT reasoning☆55Updated last year