uwplse / potpieLinks
Proof Object Transformation, Preserving Imp Embeddings: the first proof compiler to be formally proven correct
☆16Updated last year
Alternatives and similar repositories for potpie
Users that are interested in potpie are comparing it to the libraries listed below
Sorting:
- Tiny verified SAT-solver☆28Updated 3 years ago
- Two-Level Type Theory☆28Updated 5 years ago
- An equational theorem prover based on Knuth-Bendix completion☆54Updated 2 months ago
- Interactive Theorem Proving for students☆20Updated 2 years ago
- Formally verified operator language and rewriting engine for high-performance computing☆29Updated last year
- A formally verified compiler for a simple language with numbers and sums☆27Updated 4 years ago
- Graded Dependent Type systems☆25Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 years ago
- Formalization of type theory☆22Updated 4 years ago
- Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup☆16Updated 6 years ago
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated last month
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Gallina to Bedrock2 compilation toolkit☆59Updated last week
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- LLVM support for the lean theorem prover☆51Updated 3 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- embedding MLIR in LEAN☆47Updated last year
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 11 months ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A library for verifying graph-manipulating programs. Powered by Coq and VST. Compatible with CompCert.☆18Updated 3 weeks ago
- Coq library of arbitrarily large numbers, providing BigN, BigZ, BigQ that used to be part of the standard library [maintainers=@proux01,@…☆25Updated last month
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- Racket Equivalence Graph Library☆19Updated 3 years ago
- Lean type-checker written in Scala.☆36Updated 3 years ago
- Constructive Galois connections☆35Updated 7 years ago
- ☆13Updated last month