uuverifiers / princessLinks
The Princess Theorem Prover
☆26Updated 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☆91Updated 2 months ago
- Dependent Object Types (DOT), bottom up☆87Updated 3 years ago
- Proof assistant based on first-order logic and set theory☆38Updated 8 months ago
- Formalization of the Dependent Object Types (DOT) calculus☆66Updated 2 years ago
- A Scala library for controlling/interacting with Isabelle☆40Updated 2 weeks ago
- A Coq-based synthesis of Scala programs which are correct-by-construction☆79Updated 3 years ago
- GAPT: General Architecture for Proof Theory☆100Updated 2 weeks ago
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆33Updated 2 months ago
- LL(1) parser combinators in Scala☆59Updated 4 months ago
- System FR: Formalized Foundations for Stainless☆9Updated 3 years ago
- Staged Abstract Interpreters☆66Updated 2 years ago
- ☆19Updated 2 years ago
- DSL in Scala for Constraint Solving with Z3 SMT Solver☆124Updated 2 years ago
- Fast streams for Scala 3☆52Updated 4 months ago
- prototyping logic programming in Scala☆41Updated 3 years ago
- A Scala library for language processing.☆47Updated 9 months ago
- ☆55Updated 2 months ago
- Scala implementation of ILC, with benchmarks☆28Updated 8 years ago
- A Cheat Sheet for Coq Developers who want to try LeanProver☆17Updated last year
- Interaction net / combinator language based on https://core.ac.uk/download/pdf/81113716.pdf☆30Updated last year
- Linear types in Scala☆43Updated last week
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated 8 months ago
- Sturdy is a library for developing sound static analyses in Haskell.☆61Updated 2 years ago
- ☆51Updated 4 months ago
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆45Updated 3 months ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- Here we do all categorical calculations, for small (aka, embeddable fully into a program) categories☆25Updated last week
- The CafeSat SMT solver for Scala☆48Updated 3 years ago
- Towards changing things and see if it proofs☆60Updated 3 years ago
- Bolts: Stainless Verified Scala Examples☆22Updated 3 weeks ago