epfl-lara / lisa
Proof assistant based on first-order logic and set theory
☆35Updated 4 months ago
Alternatives and similar repositories for lisa:
Users that are interested in lisa are comparing it to the libraries listed below
- Dependent Object Types (DOT), bottom up☆83Updated 3 years ago
- Solver for higher-order functional programs, used by Stainless☆89Updated last week
- Bolts: Stainless Verified Scala Examples☆20Updated last week
- The Princess Theorem Prover☆26Updated 2 weeks ago
- LL(1) parser combinators in Scala☆58Updated this week
- Interaction net / combinator language based on https://core.ac.uk/download/pdf/81113716.pdf☆29Updated 9 months ago
- GAPT: General Architecture for Proof Theory☆97Updated 2 months ago
- System FR: Formalized Foundations for Stainless☆9Updated 3 years ago
- Formalization of the Dependent Object Types (DOT) calculus☆64Updated 2 years ago
- DSL in Scala for Constraint Solving with Z3 SMT Solver☆123Updated last year
- A Scala library for controlling/interacting with Isabelle☆37Updated 7 months ago
- ☆54Updated last year
- Interactive Theorem Proving based on Inox☆10Updated 5 years ago
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆44Updated last month
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆30Updated 3 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…☆35Updated 2 months ago
- Lean type-checker written in Scala.☆34Updated 2 years ago
- A monadic library for symbolic evaluation☆58Updated this week
- The Penn Locally Nameless Metatheory Library☆74Updated 7 months ago
- High level commands to declare a hierarchy based on packed classes☆97Updated this week
- ☆19Updated 2 years ago
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆31Updated 3 months ago
- Lecture notes on realizability☆67Updated 4 months ago
- Separation Logic Proofs in Lean☆34Updated last month
- A gentle introduction to Isabelle and Isabelle/HOL☆10Updated 6 months ago
- A Scala library which talks to Isabelle (DISCONTINUED)☆38Updated 4 years ago
- SHAPE/S∀F∃: static prover/type-checker for N-D array programming in Scala, a use case of intuitionistic type theory☆30Updated 10 months ago
- Coq plugin embedding elpi☆143Updated this week
- Logical Relation for MLTT in Coq☆23Updated this week
- A bottom-up approach to a verified implementation of MLTT☆17Updated last month