formal-land / coq-bonsaiLinks
🌳 Generate a fresh bonsai in your terminal
☆25Updated 3 years ago
Alternatives and similar repositories for coq-bonsai
Users that are interested in coq-bonsai are comparing it to the libraries listed below
Sorting:
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated last month
- ᚛ A type of divination employed in attempts to locate identifiers matching a given type expression☆34Updated 2 weeks ago
- An OCaml EDSL for describing and solving strategic games☆17Updated last year
- A Datalog implementation with an OCaml inspired module system☆44Updated 6 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- A library of splittable pseudo-random number generators for OCaml☆34Updated 4 months ago
- flexible 'let rec' generation for MetaOCaml☆26Updated 2 weeks ago
- Experimental type-checker for internally parametric type theory☆32Updated 2 months ago
- A repository of MetaOCaml packages☆12Updated 2 weeks ago
- multi-shot continuations in OCaml☆48Updated 3 months ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago
- ☆11Updated last month
- OCaml implementation of histogram-approximation algorithm☆15Updated 2 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 8 months ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- Effects-based OCaml Nameserver☆20Updated this week
- A Coq plugin that implements exceptions in Coq☆13Updated 4 years ago
- An eDSL for MirageOS apps☆20Updated 6 years ago
- Lower-Kinded Optics for OCaml☆23Updated 2 months ago
- OCaml with typed algebraic effects☆50Updated 6 years ago
- Parsing library based on Earley Algorithm☆18Updated 4 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- A parsing library that compiles grammars to combinators using elimination of left recursion☆22Updated last year
- Efficient binder representation in OCaml☆42Updated 10 months ago
- A Pretty Printer, based on Philip Wadler's "A prettier printer". But heavily modified to be efficient in a strict language.☆19Updated 4 years ago
- A tool that creates stand-alone source bundles from opam packages☆26Updated 2 years ago
- Choice operator in OCaml, providing a backtracking monad☆25Updated 3 years ago
- HardCaml implementation of the OCaml ZINC Abstract Machine☆44Updated 5 years ago