yallop / ocaml-re-nfaLinks
OCaml code to construct an NFA from a regular expression
☆52Updated 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
Sorting:
- ReasonML code to construct an NFA from a regular expression☆24Updated 6 years ago
- Automatically exported from code.google.com/p/intuitionistic☆31Updated 10 years ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆48Updated 8 months ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- How do you do that recursive GADT thing again?☆28Updated last year
- Mystery Languages☆38Updated last year
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- ☆43Updated 3 years ago
- A ML-like pure functional language that can be used as a template for creating your own language☆28Updated 5 months ago
- Hanoi tower in Coq☆26Updated last month
- Lexer and parser generators for Standard ML, OCaml, and Haskell.☆37Updated 2 years ago
- Offline partial evaluation system for Prolog written using the cogen approach☆19Updated 8 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 4 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- A survey of semantics styles in Coq, from natural semantics through structural operational, axiomatic, and denotational semantics, to abs…☆51Updated 3 years ago
- A formally verified compiler for a simple language with numbers and sums☆27Updated 4 years ago
- Reparse is a monadic, recursive descent based, comprehensive parser construction library for ocaml.☆53Updated 3 years ago
- SKI combinators☆55Updated 8 years ago
- A modular sat/smt solver with proof output.☆99Updated last year
- Monadic effects and equational reasoning in Rocq☆72Updated this week
- IO for Gallina☆34Updated 3 months ago
- A "implementation" of Girard's paradox in OCaml☆108Updated 10 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Efficient binder representation in OCaml☆42Updated 11 months ago
- Implementation of Nuprl's type theory in Coq☆45Updated 6 months ago
- An HTML documentation generator for Coq source files☆30Updated 10 months ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Coq development accompanying the paper "Efficient Extensional Binary Tries"☆22Updated last year