epfl-lara / lisaLinks
Proof assistant based on first-order logic and set theory
☆62Updated 3 weeks ago
Alternatives and similar repositories for lisa
Users that are interested in lisa are comparing it to the libraries listed below
Sorting:
- Bolts: Stainless Verified Scala Examples☆26Updated last month
- Dependent Object Types (DOT), bottom up☆87Updated 3 years ago
- Formalization of the Dependent Object Types (DOT) calculus☆66Updated 2 years ago
- GAPT: General Architecture for Proof Theory☆101Updated this week
- Solver for higher-order functional programs, used by Stainless☆92Updated 4 months ago
- Interaction net / combinator language based on https://core.ac.uk/download/pdf/81113716.pdf☆30Updated last year
- A Scala library for controlling/interacting with Isabelle☆40Updated 2 months ago
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆33Updated last month
- System FR: Formalized Foundations for Stainless☆10Updated 3 years ago
- A Cheat Sheet for Coq Developers who want to try LeanProver☆17Updated 2 years ago
- LL(1) parser combinators in Scala☆60Updated 6 months ago
- ☆53Updated last week
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆45Updated 5 months ago
- ☆36Updated 2 weeks ago
- prototyping logic programming in Scala☆41Updated 3 years ago
- ☆55Updated 4 months ago
- Educational Proof Assistant for Type Theory☆74Updated last year
- Lean type-checker written in Scala.☆36Updated 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…☆37Updated last month
- The Princess Theorem Prover☆26Updated this week
- Rhyme is an Expressive Data-Centric Query Language☆30Updated 2 months ago
- DSL in Scala for Constraint Solving with Z3 SMT Solver☆126Updated 2 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆55Updated 4 years ago
- Scala implementation of ILC, with benchmarks☆28Updated 9 years ago
- Here we do all categorical calculations, for small (aka, embeddable fully into a program) categories☆25Updated 2 months ago
- Dafny for Metatheory of Programming Languages☆26Updated 3 months ago
- A monadic library for symbolic evaluation☆68Updated last month
- ☆44Updated last month
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆67Updated 10 months ago
- The Penn Locally Nameless Metatheory Library☆75Updated 5 months ago