fold-lang / fold
A meta-language for OCaml. (Unreleased)
☆25Updated 2 months ago
Alternatives and similar repositories for fold:
Users that are interested in fold are comparing it to the libraries listed below
- Ropes ("heavyweight strings") for OCaml☆49Updated 6 months ago
- OCaml with typed algebraic effects☆49Updated 6 years ago
- Yet another type combinator library☆54Updated 2 years ago
- Matching Regular Expressions with OCaml Patterns☆55Updated 2 years ago
- Open records implemented using map over universal type☆33Updated 4 years ago
- Algorithms to layout trees in a pretty manner.☆36Updated 2 years ago
- Optional compilation for OCaml☆63Updated 3 months ago
- Reactive programming… in the shell☆30Updated 7 years ago
- Simple, efficient iterators for OCaml☆59Updated last year
- Library to provide Erlang style distributed computations. This library is inspired by Cloud Haskell.☆58Updated 5 years ago
- Minimalistic logic programming framework☆23Updated 5 years ago
- A simple state-machine framework for OCaml based on QCheck☆65Updated 3 years ago
- Fast native fibers for OCaml☆38Updated 6 years ago
- A quirky object oriented standard library for ocaml☆17Updated 3 years ago
- An easy interface on top of the Irmin library.☆45Updated 4 years ago
- Learning Reason/OCaml by making an old-school canvas game.☆24Updated 7 years ago
- Cross-runtime object interface generation☆35Updated 3 years ago
- Constant time equal function to avoid timing attacks in OCaml☆51Updated 7 months ago
- PPX rewriter that enables string interpolation in OCaml☆44Updated last year
- Very simple gzip library for OCaml☆22Updated 3 years ago
- A tool to create PDFs that are also OCaml bytecodes☆40Updated last year
- Pretty-printing library for OCaml☆43Updated 2 years ago
- S-expression pretty-printer☆21Updated 5 months ago
- An OCaml library for describing and simulating synchronous finite state machines")☆32Updated 3 years ago
- SDK to extend Merlin☆28Updated 4 months ago
- Simple, secure and composable abstraction for construction of efficient data flows.☆16Updated 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
- The future of ppx https://discuss.ocaml.org/t/the-future-of-ppx/☆53Updated 4 years ago
- Lazy prefix trees in OCaml☆23Updated 5 years ago
- Aurochs is a parser generator that uses the parse expression grammar (PEG) or "packrat" approach. It takes a grammar in a BNF-like notat…☆45Updated last year