jmid / regexpanalyserLinks
Lattice valued regular expressions and an example analysis
☆10Updated 3 years ago
Alternatives and similar repositories for regexpanalyser
Users that are interested in regexpanalyser are comparing it to the libraries listed below
Sorting:
- 🌳 Generate a fresh bonsai in your terminal☆27Updated 3 years ago
- An OCaml EDSL for describing and solving strategic games☆17Updated last year
- Identifying similar OCaml codes☆29Updated 11 months ago
- Formalising session types in Coq☆17Updated 5 years ago
- QUICr parametric abstract domain for sets☆12Updated 10 years ago
- A simple and portable floating-point interval arithmetic library in OCaml☆10Updated 3 years ago
- OCaml implementation of histogram-approximation algorithm☆15Updated 2 years ago
- A simple BDD library for OCaml☆13Updated last month
- Formal Semantics for Why3☆18Updated this week
- [research] A modular SMT solver in OCaml, based on mcSAT☆39Updated last year
- Small tensor library a la GLSL☆17Updated 2 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆26Updated last year
- Implementation of a language interpreter in the browser, using js_of_ocaml.☆15Updated 7 years ago
- Generate a webpage with mathematical formulae, OCaml output and graphics from markdown☆16Updated 2 years ago
- ☆13Updated 5 years ago
- Tactic for polynomial manipulations☆10Updated last month
- A not-quite-so-simple Binary Decision Diagrams implementation for OCaml☆37Updated 3 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago
- ☆11Updated 2 years ago
- A stack-driven generator of arbitrary WebAssembly programs☆19Updated 3 years ago
- (Extremely) simple standalone symbolic algebra library in OCaml. (Mirrored from original site.)☆12Updated 13 years ago
- An exact real arithmetic (aka constructive reals) for OCaml☆13Updated last year
- A Pretty Printer, based on Philip Wadler's "A prettier printer". But heavily modified to be efficient in a strict language.☆19Updated 4 years ago
- A model-based QuickCheck test of ptrees (Patricia trees)☆12Updated 5 years ago
- Efficient binder representation in OCaml☆42Updated last year
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated 3 months ago
- Foundational Verification of Hybrid Systems☆15Updated 8 years ago
- A library of splittable pseudo-random number generators for OCaml☆35Updated 5 months ago
- Kleene algebra modulo theories☆27Updated 2 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago