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 5 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- Interactive Theorem Proving for students☆20Updated 2 years ago
- Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup☆16Updated 6 years ago
- An equational theorem prover based on Knuth-Bendix completion☆54Updated 2 weeks ago
- Graded Dependent Type systems☆25Updated 2 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 years ago
- Coq library for serialization to S-expressions☆19Updated 2 years ago
- LLVM support for the lean theorem prover☆51Updated 4 years ago
- Tiny verified SAT-solver☆29Updated 3 years ago
- Formally verified operator language and rewriting engine for high-performance computing☆29Updated last year
- Gallina to Bedrock2 compilation toolkit☆60Updated this week
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Dependently typed lambda calculus - A Simple Proof Assistant☆12Updated 5 years ago
- embedding MLIR in LEAN☆47Updated last year
- Formal specification of the Haskell Language Report☆25Updated last week
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated last month
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- Repository where I'll collect some demos of proof assistants that I show to various people in order to spread the magic☆38Updated 2 years ago
- Modern Compiler Implementation in ML, in Haskell☆20Updated 4 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A formally verified compiler for a simple language with numbers and sums☆27Updated 4 years ago
- ☆16Updated 2 years ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆20Updated 10 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- Fast Setup for Proof by Reflection, in Two Lines of Ltac.☆14Updated 4 years ago
- Formalization of type theory☆22Updated 4 years ago
- Benchmark repository of polyglot effect handler examples☆28Updated last month