zenprotocol / contracts
Contract examples
☆10Updated 3 years ago
Alternatives and similar repositories for contracts:
Users that are interested in contracts are comparing it to the libraries listed below
- Animations for Elementary-Affine-Net interactions☆11Updated 5 years ago
- Minimal, efficient proof language☆14Updated 5 years ago
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆17Updated 5 years ago
- Formalization of Tendermint proposer election properties☆15Updated 6 years ago
- Base Formality libraries☆9Updated 5 years ago
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Updated 11 years ago
- An implementation of the Formality language in C☆13Updated 5 years ago
- Elliptic Curve Cryptography in Haskell☆13Updated 9 months ago
- Agda libraries relevant to Moonad☆14Updated 5 years ago
- A functional smart contract system☆6Updated 5 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- Specification of the Cedilleum language, a dependently typed language with pattern matching that compiles to Cedille Core☆26Updated 5 years ago
- Program verification with F* course materials☆11Updated 5 years ago
- State-Transition Systems for Smart Contracts☆24Updated 4 years ago
- Optimized Patricia trie with disk storage☆31Updated 5 years ago
- Blockchain Technology for the Working Mathematician☆24Updated 7 years ago
- ☆16Updated 6 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- Multihash Haskell implementation☆27Updated last year
- Collection of composable P2P libraries☆25Updated 3 years ago
- An ML-inspired smart contract language, compiling to Tezos' Michelson VM☆22Updated 7 years ago
- Source files used for the Cedille Cast videos☆12Updated 4 years ago
- working with coq and tezos☆28Updated 7 years ago
- A nano "theorem prover".☆61Updated 5 years ago
- Mechanised meta theory for Plutus Core (DEPRECATED - MOVED to plutus)☆9Updated 3 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- An upcoming operating system built on Type-Theory☆43Updated 4 years ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆20Updated 9 years ago
- The Spire Programming Language☆59Updated 10 years ago
- OCaml library for combinatorics☆35Updated 4 months ago