epfl-lara / lisaLinks
Proof assistant based on first-order logic and set theory
☆38Updated 7 months ago
Alternatives and similar repositories for lisa
Users that are interested in lisa are comparing it to the libraries listed below
Sorting:
- Solver for higher-order functional programs, used by Stainless☆91Updated last month
- LL(1) parser combinators in Scala☆59Updated 3 months ago
- Dependent Object Types (DOT), bottom up☆87Updated 3 years ago
- Bolts: Stainless Verified Scala Examples☆22Updated last week
- A Scala library for controlling/interacting with Isabelle☆40Updated 3 weeks ago
- Interaction net / combinator language based on https://core.ac.uk/download/pdf/81113716.pdf☆30Updated last year
- GAPT: General Architecture for Proof Theory☆100Updated this week
- Formalization of the Dependent Object Types (DOT) calculus☆66Updated 2 years ago
- DSL in Scala for Constraint Solving with Z3 SMT Solver☆124Updated 2 years ago
- ☆55Updated last month
- The Princess Theorem Prover☆26Updated last week
- ☆49Updated 3 months ago
- System FR: Formalized Foundations for Stainless☆9Updated 3 years ago
- Natty is a natural-language proof assistant with an embedded automatic prover for higher-order logic. It is in an early stage of develop…☆34Updated this week
- The Penn Locally Nameless Metatheory Library☆74Updated 2 months ago
- Logic and Mechanized Reasoning☆104Updated 4 months ago
- ☆33Updated 7 months ago
- Lean type-checker written in Scala.☆36Updated 3 years ago
- A library of Coq definitions, theorems, and tactics. [maintainers=@gmalecha,@liyishuai]☆131Updated 5 months ago
- A (WIP) equality saturation tactic for Lean based on egg.☆60Updated this week
- Coq plugin embedding elpi☆167Updated last week
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆31Updated last month
- EPIT 2020 - Spring School on Homotopy Type Theory☆105Updated 3 years ago
- An Automated Theorem Prover for Classical Higher-Order Logic with Henkin Semantics☆47Updated last month
- An automatic theorem prover in OCaml for typed higher-order logic with equality and datatypes, based on superposition+rewriting; and Logt…☆144Updated 7 months ago
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆66Updated last year
- Course website for Math 721: Homotopy Type Theory, taught at Johns Hopkins in Fall 2021☆47Updated 3 years ago
- Separation Logic Proofs in Lean☆36Updated 2 months ago
- ☆36Updated 2 months ago
- A Coq-based synthesis of Scala programs which are correct-by-construction☆79Updated 3 years ago