epfl-lara / lisaLinks
Proof assistant based on first-order logic and set theory
☆64Updated 3 weeks ago
Alternatives and similar repositories for lisa
Users that are interested in lisa are comparing it to the libraries listed below
Sorting:
- Dependent Object Types (DOT), bottom up☆89Updated 3 years ago
- Solver for higher-order functional programs, used by Stainless☆93Updated 3 months ago
- Bolts: Stainless Verified Scala Examples☆26Updated last week
- GAPT: General Architecture for Proof Theory☆106Updated 3 weeks ago
- LL(1) parser combinators in Scala☆61Updated 3 months ago
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆36Updated 3 months ago
- System FR: Formalized Foundations for Stainless☆12Updated 3 months ago
- Interaction net / combinator language based on https://core.ac.uk/download/pdf/81113716.pdf☆30Updated last year
- A Cheat Sheet for Coq Developers who want to try LeanProver☆18Updated 2 years ago
- A Scala library for controlling/interacting with Isabelle☆40Updated 6 months ago
- Formalization of the Dependent Object Types (DOT) calculus☆66Updated 3 years ago
- ☆53Updated 2 months ago
- The Princess Theorem Prover☆30Updated this week
- ☆56Updated 8 months ago
- ☆42Updated 4 months ago
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆46Updated 9 months ago
- Lean type-checker written in Scala.☆40Updated 3 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated last week
- A toolkit for enforcing logical specifications on neural networks☆122Updated this week
- Coq code formatter☆24Updated last week
- The Penn Locally Nameless Metatheory Library☆76Updated 9 months ago
- DSL in Scala for Constraint Solving with Z3 SMT Solver☆126Updated 2 years ago
- ☆52Updated last week
- prototyping logic programming in Scala☆42Updated 3 years ago
- ☆38Updated 9 months ago
- Logical Relation for MLTT in Coq☆28Updated last month
- Natty is a natural-language proof assistant with an embedded automatic prover for higher-order logic. It is in an early stage of develop…☆38Updated this week
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆71Updated last year
- Lecture notes on realizability☆75Updated 10 months ago
- A monadic library for symbolic evaluation☆73Updated 5 months ago