yallop / ocaml-re-nfa
OCaml code to construct an NFA from a regular expression
☆51Updated 4 years ago
Alternatives and similar repositories for ocaml-re-nfa:
Users that are interested in ocaml-re-nfa are comparing it to the libraries listed below
- ReasonML code to construct an NFA from a regular expression☆24Updated 6 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- How do you do that recursive GADT thing again?☆27Updated last year
- ☆43Updated 3 years ago
- Hanoi tower in Coq☆25Updated 4 months ago
- Automatically exported from code.google.com/p/intuitionistic☆31Updated 10 years ago
- A benchmark suite for the OCaml compiler☆83Updated 7 months ago
- LL(1) parser generator verified in Coq☆46Updated 5 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆28Updated 3 weeks ago
- multi-shot continuations in OCaml☆48Updated 2 months ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆47Updated 6 months ago
- A Deductive Verification Tool for OCaml Programs☆69Updated last month
- OCaml hash-consing library☆51Updated last year
- 🦠 Reusable components based on algebraic effects☆50Updated 6 months ago
- Tools for record-and-replay debugging☆43Updated 2 years ago
- A "implementation" of Girard's paradox in OCaml☆106Updated 10 years ago
- A modular sat/smt solver with proof output.☆99Updated last year
- Abstracting Definitional Interpreters☆67Updated 7 years ago
- Multiparty Session Types in OCaml☆59Updated 5 months ago
- A deterministic parser with fused lexing☆72Updated last year
- Purely functional GUI algebra☆75Updated 2 weeks ago
- An OCaml library for manipulating Labeled Transition Systems☆24Updated last year
- Kleene algebra modulo theories☆27Updated 2 years ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 4 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆101Updated last year
- Efficient binder representation in OCaml☆42Updated 9 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A clean implementation of Parsing with Zippers.☆37Updated 6 years ago
- A ML-like pure functional language that can be used as a template for creating your own language☆28Updated 3 months ago