uwplse / potpie
Proof Object Transformation, Preserving Imp Embeddings: the first proof compiler to be formally proven correct
☆14Updated last month
Related projects: ⓘ
- Dependently typed lambda calculus - A Simple Proof Assistant☆11Updated 4 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- Two-Level Type Theory☆27Updated 4 years ago
- A certified semantics for relational programming workout.☆25Updated 3 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- Inefficient and syntactically unwieldy implementation of algebraic effects in Python using generators☆14Updated 4 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆24Updated 8 months ago
- library with a semiring class and some useful semirings☆11Updated 4 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆19Updated 10 months ago
- Graded Dependent Type systems☆23Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 3 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 5 years ago
- Coq library for serialization to S-expressions☆18Updated last year
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆23Updated this week
- An equational theorem prover based on Knuth-Bendix completion☆49Updated 3 months ago
- An implementation of a simple Neural network in Idris using category theory.☆22Updated 5 months ago
- HoTT group project to TeXify Cartmell's PhD thesis “Generalised Algebraic Theories and Contextual Categories”☆14Updated last year
- Code for tutorials, papers and experiments. Mostly Agda, Coq and Haskell.☆19Updated last year
- Lenses in Coq☆17Updated last year
- A formalization of bitset operations in Coq and the corresponding axiomatization and extraction to OCaml native integers [maintainer=@ant…☆22Updated last month
- ☆12Updated this week
- Proof combinators used in Liquid Haskell for theorem proving☆12Updated 6 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.☆21Updated 7 years ago
- Linear map categories in Agda☆5Updated last year
- Formally verified operator language and rewriting engine for high-performance computing☆22Updated 3 months ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- A proof of Abel-Ruffini theorem.☆28Updated last month
- Implementation of Nuprl's type theory in Coq☆44Updated 3 years ago
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆22Updated last month
- Gallina to Bedrock2 compilation toolkit☆49Updated last month