formal-land / coq-bonsaiLinks
π³ Generate a fresh bonsai in your terminal
β28Updated 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:
- An OCaml EDSL for describing and solving strategic gamesβ17Updated last year
- Formal Semantics for Why3β18Updated 3 weeks ago
- Formalising session types in Coqβ17Updated 5 years ago
- β11Updated 3 months ago
- πΉ A library for hierarchical names and lexical scopingβ26Updated 10 months ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.β38Updated 3 years ago
- Efficient binder representation in OCamlβ43Updated last year
- Effects-based OCaml Nameserverβ20Updated 2 months ago
- Implementation of sprintf for Coqβ18Updated 5 years ago
- A Certified Interpreter for ML with Structural Polymorphismβ44Updated 3 months ago
- multi-shot continuations in OCamlβ48Updated 5 months ago
- IO should be just a libraryβ23Updated 2 years ago
- Automatically generates Coq FFI bindings to OCaml libraries [maintainer=@lthms]β38Updated 2 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org projectβ15Updated 6 years ago
- A Coq plugin that implements exceptions in Coqβ14Updated 4 years ago
- An OCaml library for creating pandoc filters.β32Updated 9 months ago
- A simple Ξ»Prolog interpreterβ20Updated 3 years ago
- β12Updated 5 years ago
- Code for "Staged Generic Programming" (ICFP 2017)β26Updated last year
- Generate a webpage with mathematical formulae, OCaml output and graphics from markdownβ16Updated 2 years ago
- A library of splittable pseudo-random number generators for OCamlβ35Updated 6 months ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.β31Updated 6 years ago
- flexible 'let rec' generation for MetaOCamlβ26Updated 2 months ago
- A Datalog implementation with an OCaml inspired module systemβ44Updated 6 years ago
- MPRI-2.4 Dependently-typed Functional Programmingβ32Updated 4 years ago
- A parsing library that compiles grammars to combinators using elimination of left recursionβ22Updated last year
- α A type of divination employed in attempts to locate identifiers matching a given type expressionβ37Updated 2 months ago
- Tactic for polynomial manipulationsβ10Updated 2 months ago
- Coq development accompanying the paper "Efficient Extensional Binary Tries"β21Updated last year
- IO for Gallinaβ33Updated last month