anoma / gebLinks
A Categorical View of Computation
☆33Updated 10 months ago
Alternatives and similar repositories for geb
Users that are interested in geb are comparing it to the libraries listed below
Sorting:
- Collection of Kind2 programs and proofs☆12Updated last year
- A zero-knowledge Lean4 compiler and kernel☆138Updated 9 months ago
- Lisp implementation of Lurk.☆73Updated 11 months ago
- A WebAssembly implementation in Lean4☆34Updated last year
- A common lisp DSL for writing zero knowledge circuits☆18Updated 2 years ago
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- (early experiments toward) a version-control system for structured data☆17Updated 2 years ago
- An upcoming operating system built on Type-Theory☆43Updated 5 years ago
- A minimal proof checker.☆75Updated 11 months ago
- Lurk is a Turing-complete programming language for zk-SNARKs. It is a statically scoped dialect of Lisp, influenced by Scheme and Common …☆109Updated 4 months ago
- The Keelung Language☆52Updated 11 months ago
- A Rust implementation of the Lean kernel☆12Updated 2 years ago
- The Glow language for Blockchain Decentralized Applications.☆59Updated 3 months ago
- The Juvix standard library☆18Updated this week
- Linear lens☆20Updated last year
- A model of the RISC Zero zkVM and ecosystem in the Lean 4 Theorem Prover☆70Updated 2 years ago
- An implementation of Haskell’s MVars in Racket☆30Updated 10 months ago
- Domain Specific Languages for Computational Law☆77Updated last month
- Lean 4 port of Megaparsec☆29Updated last year
- ☆44Updated 2 years ago
- ☆43Updated 3 years ago
- A framework for smart contract verification in Coq☆122Updated last week
- dependently-typed lisp with flexible compiler backends☆27Updated 6 years ago
- Specification of the Cedilleum language, a dependently typed language with pattern matching that compiles to Cedille Core☆28Updated 6 years ago
- Lean circuit DSL☆87Updated this week
- a zero-knowledge proof-carrying code platform for Lean 4☆45Updated this week
- A Coq formalization of the textbook Categories and Toposes: Visualized and Explained☆20Updated 2 years ago
- Class of data structures that can be unfolded.☆22Updated last year
- A minimal pure functional language based on self dependent types.☆73Updated 3 years ago
- Prime numbers for Coq☆42Updated last week