uwplse / potpieLinks
Proof Object Transformation, Preserving Imp Embeddings: the first proof compiler to be formally proven correct
☆16Updated 10 months ago
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
- An interface for using mwillsey/egg with math simplification.☆13Updated last year
- a self-hosting lambda calculus compiler☆35Updated 2 months ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆20Updated 8 months 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
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- An extended typed Lambda Calculus☆21Updated 10 months ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- An equational theorem prover based on Knuth-Bendix completion☆52Updated 2 months ago
- Coq library for serialization to S-expressions☆19Updated last year
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Formalization of Wigderson's graph coloring algorithm in Coq☆9Updated last year
- Dafny for Metatheory of Programming Languages☆25Updated last month
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆23Updated 8 months ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆31Updated 2 weeks ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Updated 7 years ago
- A Haskell implementation of the code within Walid Taha's ``A Gentle Introduction to Multi-stage Programming''☆10Updated 6 years ago
- A termination checker for higher-order rewriting with dependent types☆10Updated 5 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 7 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- A formalization of bitset operations in Coq and the corresponding axiomatization and extraction to OCaml native integers [maintainer=@ant…☆23Updated last month
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup☆15Updated 6 years ago
- ☆16Updated last year
- Linear map categories in Agda☆5Updated 2 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago