isabelle-prover / isabelle-linterLinks
Linter component for Isabelle.
☆20Updated last month
Alternatives and similar repositories for isabelle-linter
Users that are interested in isabelle-linter are comparing it to the libraries listed below
Sorting:
- A library of mechanised undecidability proofs in the Coq proof assistant.☆127Updated 3 weeks ago
- "proving-contest"-backends for several theorem provers☆13Updated last year
- Variations on Kirby & Paris' hydra battles and other entertaining math in Coq (collaborative, documented, includes exercises) [maintaine…☆81Updated last year
- The MMT Language and System☆79Updated 4 months ago
- A formal proof of the independence of the continuum hypothesis☆142Updated last year
- High level commands to declare a hierarchy based on packed classes☆104Updated this week
- Pedagogical first-order prover in Python☆79Updated 7 months ago
- Type-checker for the λΠ-calculus modulo rewriting☆225Updated 2 months ago
- Implementation of higher-order logic in Python☆65Updated 2 years ago
- Schemes in Lean (v2)☆43Updated 5 years ago
- Very controlled natural language tactics for Lean☆66Updated 2 years ago
- Coq Repository at Nijmegen [maintainers=@spitters,@VincentSe,@Lysxia]☆115Updated 3 weeks ago
- KeYmaera X: An aXiomatic Tactical Theorem Prover for Hybrid Systems (release)☆88Updated 2 months ago
- A Probability Theory Library for the Coq Theorem Prover☆54Updated 2 years ago
- **(Deprecated: Merged into Lean 4)** Lean 4 build system and package manager with configuration files written in Lean.☆101Updated 2 years ago
- ☆33Updated 2 years ago
- Formalization of Machine Learning Theory with Applications to Program Synthesis☆78Updated 3 months ago
- A Seamless, Interactive Tactic Learner and Prover for Coq☆82Updated last month
- A book about functional programming in Lean☆45Updated last year
- Graph Theory [maintainers=@chdoc,@damien-pous]☆41Updated 3 months ago
- Topos theory in lean☆64Updated 5 years ago
- A best-first-search theorem prover implemented in Isabelle☆36Updated 3 years ago
- An automatic theorem prover in OCaml for typed higher-order logic with equality and datatypes, based on superposition+rewriting; and Logt…