Alternatives and similar repositories for ocaml-re-nfa

Users that are interested in ocaml-re-nfa are comparing it to the libraries listed below

• joelonsql / reason-re-nfa
  ReasonML code to construct an NFA from a regular expression
  ☆24Updated 6 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• ianthehenry / ocamlsyntax.com
  How do you do that recursive GADT thing again?
  ☆28Updated last year
• art-w / unicorn
  Purely functional GUI algebra
  ☆78Updated 4 months ago
• Gbury / mSAT
  A modular sat/smt solver with proof output.
  ☆101Updated last year
• yallop / ocaml-asp
  Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc
  ☆102Updated 3 months ago
• Ucombinator / parsing-with-zippers
  A clean implementation of Parsing with Zippers.
  ☆38Updated 6 years ago
• granstrom / intuitionistic
  Automatically exported from code.google.com/p/intuitionistic
  ☆31Updated 10 years ago
• reynir / Brainfuck
  Brainfuck formalized in Coq
  ☆26Updated 3 years ago
• ocaml-gospel / cameleer
  A Deductive Verification Tool for OCaml Programs
  ☆75Updated 3 weeks ago
• RedPRL / algaeff
  🦠 Reusable components based on algebraic effects
  ☆51Updated 2 weeks ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆47Updated 5 years ago
• modular-macros / ocaml-macros
  OCaml with macros
  ☆58Updated 2 months ago
• Deducteam / Logipedia
  An encyclopedia of proofs
  ☆62Updated 9 months ago
• dbp / funtal
  FunTAL: mixing a functional language with assembly.
  ☆40Updated 8 years ago
• Lysxia / advent-of-coq-2021
  ☆44Updated 3 years ago
• thery / hanoi
  Hanoi tower in Coq
  ☆26Updated last month
• rlepigre / ocaml-bindlib
  Efficient binder representation in OCaml
  ☆43Updated last year
• mgree / kmt
  Kleene algebra modulo theories
  ☆27Updated 2 years ago
• Gbury / dolmen
  Dolmen provides a library and a binary to parse, typecheck, and evaluate languages used in automated deduction
  ☆88Updated 2 weeks ago
• dannywillems / RML
  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
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆109Updated 10 years ago
• xavierleroy / coq2html
  An HTML documentation generator for Coq source files
  ☆31Updated last year
• garrigue / certint
  A Certified Interpreter for ML with Structural Polymorphism
  ☆44Updated 4 months ago
• ocaml-gospel / gospel
  A tool-agnostic formal specification language for OCaml.
  ☆146Updated 3 weeks ago
• elpinal / bright-ml
  A statically-typed programming language based on "F-ing modules"
  ☆81Updated 5 years ago
• rocq-community / topology
  General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]
  ☆51Updated 10 months ago
• ocaml-bench / sandmark
  A benchmark suite for the OCaml compiler
  ☆84Updated last year
• rocq-community / huffman
  Correctness proof of the Huffman coding algorithm in Coq [maintainer=@palmskog]
  ☆14Updated last year
• let-def / hotcaml
  Hotcaml: an interpreter with watching and reloading
  ☆146Updated 3 years ago