uuverifiers / princessLinks
The Princess Theorem Prover
☆29Updated this week
Alternatives and similar repositories for princess
Users that are interested in princess are comparing it to the libraries listed below
Sorting:
- Solver for higher-order functional programs, used by Stainless☆92Updated 2 months ago
- Dependent Object Types (DOT), bottom up☆89Updated 3 years ago
- LL(1) parser combinators in Scala☆61Updated 2 months ago
- Proof assistant based on first-order logic and set theory☆64Updated 3 weeks ago
- GAPT: General Architecture for Proof Theory☆103Updated 2 weeks ago
- A Scala library for controlling/interacting with Isabelle☆40Updated 5 months ago
- Formalization of the Dependent Object Types (DOT) calculus☆66Updated 3 years ago
- A Scala library for language processing.☆48Updated last year
- A Coq-based synthesis of Scala programs which are correct-by-construction☆79Updated 3 years ago
- DSL in Scala for Constraint Solving with Z3 SMT Solver☆126Updated 2 years ago
- Fast streams for Scala 3☆56Updated 9 months ago
- prototyping logic programming in Scala☆41Updated 3 years ago
- ☆56Updated 6 months ago
- ☆19Updated 3 years ago
- The fastest way to build a language☆40Updated 3 years ago
- Extensible algebraic effects with handlers☆147Updated last week
- Bolts: Stainless Verified Scala Examples☆26Updated this week
- Scala implementation of ILC, with benchmarks☆28Updated 9 years ago
- Linear types in Scala☆44Updated 2 weeks ago
- The Leon system for verification, synthesis, repair☆166Updated last year
- ☆83Updated 8 months ago
- SHAPE/S∀F∃: static prover/type-checker for N-D array programming in Scala, a use case of intuitionistic type theory☆32Updated 2 months ago
- ☆108Updated last year
- A Scala library which talks to Isabelle (DISCONTINUED)☆38Updated 5 years ago
- (Abstract) Abstract Machine Experiments using Scala☆36Updated 4 years ago
- The CafeSat SMT solver for Scala☆50Updated 4 years ago
- A fast and modern parser combinator library for Scala☆200Updated last month
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆36Updated 2 months ago
- Library for counting and enumerating things.☆47Updated 4 years ago
- Here we do all categorical calculations, for small (aka, embeddable fully into a program) categories☆25Updated 4 months ago