epfl-lara / lisaLinks
Proof assistant based on first-order logic and set theory
☆64Updated last week
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
- GAPT: General Architecture for Proof Theory☆105Updated last month
- Bolts: Stainless Verified Scala Examples☆26Updated this week
- Interaction net / combinator language based on https://core.ac.uk/download/pdf/81113716.pdf☆30Updated last year
- Solver for higher-order functional programs, used by Stainless☆92Updated 2 months ago
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆36Updated 2 months ago
- Formalization of the Dependent Object Types (DOT) calculus☆66Updated 3 years ago
- A Scala library for controlling/interacting with Isabelle☆40Updated 6 months ago
- ☆53Updated last month
- System FR: Formalized Foundations for Stainless☆10Updated 2 months ago
- LL(1) parser combinators in Scala☆61Updated 3 months ago
- A Cheat Sheet for Coq Developers who want to try LeanProver☆17Updated 2 years ago
- ☆56Updated 7 months ago
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆44Updated 9 months 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…☆38Updated this week
- The Princess Theorem Prover☆29Updated last week
- ☆41Updated 4 months ago
- Logical Relation for MLTT in Coq☆28Updated 2 weeks ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated last week
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆55Updated 4 years ago
- A monadic library for symbolic evaluation☆73Updated 4 months ago
- Demo for dependent types + runtime code generation☆72Updated 9 months ago
- Coq plugin embedding elpi☆177Updated last week
- Here we do all categorical calculations, for small (aka, embeddable fully into a program) categories☆25Updated 5 months ago
- Introduction to algebraic effects and handlers☆98Updated 7 years ago
- High level commands to declare a hierarchy based on packed classes☆103Updated 2 weeks ago
- Lean type-checker written in Scala.☆40Updated 3 years ago
- The Penn Locally Nameless Metatheory Library☆76Updated 8 months ago
- Educational Proof Assistant for Type Theory☆81Updated last week
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆71Updated last year