bobatkey / authenticated-data-structures
An implementation of generic authenticated data structures in OCaml
☆16Updated 5 years ago
Alternatives and similar repositories for authenticated-data-structures:
Users that are interested in authenticated-data-structures are comparing it to the libraries listed below
- A Datalog implementation with an OCaml inspired module system☆44Updated 6 years ago
- SubML (prototype) language☆23Updated 2 years ago
- A library of splittable pseudo-random number generators for OCaml☆34Updated last month
- A Dependently Typed Programming Language☆27Updated 4 years ago
- secret project☆17Updated 6 years ago
- CRDTs - Conflict-Free Replicated Data Types for OCaml☆48Updated 8 years ago
- OCaml backend for Agda☆39Updated 6 years ago
- Formally verified Coq serialization library with support for extraction to OCaml☆23Updated last year
- An infinity-categorical coherence typechecker☆15Updated 3 months ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆37Updated 2 years ago
- *DEPRECATED: See ocaml-multicore/ocaml-multicore* OCaml effects handlers☆27Updated 8 years ago
- OCaml back end for Idris☆22Updated 7 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 8 months ago
- An MVC library for writing interactive webpages in OCaml☆35Updated 10 years ago
- OCaml with typed algebraic effects☆49Updated 6 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- An implementation of binary session types in OCaml☆36Updated 5 years ago
- Signatures of the category theoretic style; a experiment in flattery☆27Updated 9 years ago
- Simple reference implementation of Hazelnut using js_of_ocaml and OCaml React. (frozen -- ongoing development in the hazel repo)☆29Updated 7 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- Experimental Malfunction backend for Idris☆81Updated 6 years ago
- HardCaml implementation of the OCaml ZINC Abstract Machine☆44Updated 5 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- ☆29Updated 9 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆43Updated 2 years ago
- Work on modular implicits☆24Updated 6 years ago
- Efficient binder representation in OCaml☆40Updated 7 months ago