cocreature / zkboo-hs
Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.
☆18Updated 6 years ago
Alternatives and similar repositories for zkboo-hs:
Users that are interested in zkboo-hs are comparing it to the libraries listed below
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Updated 6 years ago
- A formalization of finite, constructive log analysis using linear temporal logic☆20Updated 2 weeks ago
- Physical dimensions and operations☆9Updated 6 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- GRIN Haskell backend stripped out from JHC. (GRIN from scratch: https://github.com/grin-tech/grin)☆16Updated 6 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆14Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Updated 3 months ago
- Austin's supercompiler work☆21Updated 5 years ago
- A monadic interface for DAG construction.☆24Updated 3 years ago
- ☆23Updated 7 years ago
- Authenticated Data Structures☆15Updated 9 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- Edit is a monad for rewriting things.☆23Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- 🌋 Idris implementation of patricia tree☆22Updated 4 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- Agda-style equational reasoning in Haskell☆53Updated 2 weeks ago
- sliding fast fourier transform using haskell streaming☆13Updated 6 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 5 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- An attempt to formalize unix cat in fiat☆12Updated 7 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- Bring fusion to everyone☆13Updated 5 years ago
- ☆23Updated 7 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Extensible, Type Safe Error Handling in Haskell☆13Updated 4 years ago