j-towns / flipper
Reversible programming in Agda
☆12Updated last year
Alternatives and similar repositories for flipper:
Users that are interested in flipper are comparing it to the libraries listed below
- A Lean 4 formalization of partial combinatory algebras.☆12Updated last week
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 4 months ago
- How to read Lean☆17Updated last week
- A verified tensor library in Lean☆20Updated last week
- Graded Dependent Type systems☆24Updated last year
- Two-Level Type Theory☆28Updated 5 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- A type theory with native support for Polynomial Functors.☆39Updated last year
- ☆13Updated 2 months ago
- Category Theory & Cobordism Categories in Lean 4☆15Updated 6 months ago
- Higher Order Reverse Derivatives Efficiently - Automatic Differentiation library based on the paper "Provably correct, asymptotically eff…☆34Updated this week
- Tool for Bayesian inference on discrete models expressed as probabilistic programs, via generating functions☆22Updated 2 months ago
- Accompanying materials for "A Core Calculus for Documents"☆31Updated last year
- Git repository for the course Logika v računalništvu☆11Updated 2 years ago
- Demo for dependent types + runtime code generation☆64Updated last month
- ☆22Updated 2 years ago
- Algebraic proof discovery in Agda☆32Updated 3 years ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- Some rudimentary proofs on subtyping☆11Updated 2 years ago
- Verifying encodings into propositional logic in Lean☆12Updated last year
- A Lean 4 package for heavy numerical computations☆18Updated 3 years ago
- Tiny verified SAT-solver☆28Updated 3 years ago
- An equational theorem prover based on Knuth-Bendix completion☆49Updated last month
- GPU-based interaction nets evaluator☆15Updated 13 years ago
- An LLVM interface for Lean 4. (WIP)☆16Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Formalization of Wigderson's graph coloring algorithm in Coq☆9Updated last year
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- Proof Object Transformation, Preserving Imp Embeddings: the first proof compiler to be formally proven correct☆15Updated 4 months ago