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:
- Two-Level Type Theory☆28Updated 6 years ago
- An equational theorem prover based on Knuth-Bendix completion☆57Updated last month
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- A certified semantics for relational programming workout.☆26Updated 5 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
- A formally verified compiler for a simple language with numbers and sums☆27Updated 5 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated last month
- Graded Dependent Type systems☆25Updated 2 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 years ago
- LLVM support for the lean theorem prover☆53Updated 4 years ago
- Tiny verified SAT-solver☆30Updated 4 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- Formally verified operator language and rewriting engine for high-performance computing☆30Updated last year
- Coq library of arbitrarily large numbers, providing BigN, BigZ, BigQ that used to be part of the standard library [maintainers=@proux01,@…☆25Updated 2 months ago
- embedding MLIR in LEAN☆48Updated last year
- Gallina to Bedrock2 compilation toolkit☆65Updated this week
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup☆16Updated 7 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Matita (proof assistant) with embedded elpi☆15Updated 7 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Updated 7 years ago
- Benchmark repository of polyglot effect handler examples☆32Updated 4 months ago
- ☆21Updated 9 years ago
- Fast Setup for Proof by Reflection, in Two Lines of Ltac.☆14Updated 4 years ago
- A language-generic implementation of equality saturation in Haskell☆22Updated 7 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Supplement of the ICFP'22 paper "‘do’ Unchained: Embracing Local Imperativity in a Purely Functional Language"☆14Updated 10 months ago
- A formalization of properties of a simple imperative, memory-safe language.☆20Updated 4 years ago