gendx / ocaml-algebraLinks
An algebra system written in OCaml
☆10Updated 10 years ago
Alternatives and similar repositories for ocaml-algebra
Users that are interested in ocaml-algebra are comparing it to the libraries listed below
Sorting:
- ☆29Updated 10 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Generation of abstract binding trees☆27Updated 2 months ago
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- Luck -- A Language for Property-Based Generators☆35Updated 9 months ago
- Code for tutorials, papers and experiments. Mostly Agda, Coq and Haskell.☆21Updated 2 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- Two-Level Type Theory☆28Updated 5 years ago
- ☆16Updated 9 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- Type theory in type theory☆16Updated 13 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Updated 2 weeks ago
- ☆21Updated 7 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 7 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Graded Dependent Type systems☆25Updated 2 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- ☆17Updated 7 years ago
- ☆21Updated 9 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆36Updated 2 weeks ago
- MetaML and MetaOCaml bibliography☆97Updated last year
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago