dregex is a Java library that implements a regular expression engine using deterministic finite automata (DFA). It supports some Perl-style features and yet retains linear matching time, and also offers set operations.
- scala
- dfa
- regular-expression
- regular-expression-engine
High-speed approximate nearest neighbors for Ruby
libclang bindings for crystal (including automatic C bindings generator)
The Waterproof plugin for the Rocq proof assistant allows you to write Rocq proofs in a style that resembles handwritten mathematical proofs, designed to help university students with learning how to prove mathematical statements.
A drop-in modernization of jmoiron/sqlx that fixes lexer bugs, automates IN expansion, and adds pluggable hooks — built for Go 1.21+.
Pattern matching for the monads in the cats Clojure library
- clojure
- clojurescript
- pattern-matching
Finite sets, finite maps, multisets and generic sets
- coq
- ssreflect
- mathcomp
- finite-sets
Max’s Parser Combinators: a simple and pragmatic library for writing parsers and lexers based on combinatory parsing.
Cicili: Safe Modern C Solution. The C language in S-expressions — Lisp macros with type inference as C's build system: generics, RAII, refcounting and pattern matching with zero runtime and no GC.
Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]
- coq
- mathcomp
- regular-languages
- ssreflect
Modified HP-48 Superchip Binary to address undesirable quirks present in the platform.
Graph Theory [maintainers=@chdoc,@damien-pous]
- coq
- graph-theory
- mathcomp
- docker-coq-action
Automatically makes package.json projects (such as npm packages and node.js modules) compatible with Deno.
The Advanced Scripting Framework is a modern scripting for VBA: JavaScript-like syntax, classes with inheritance, map/filter/reduce, closures, regex. No COM, works everywhere. Transform Excel automation.
Scala Native BLAS (Basic Linear Algebra Subprograms) supporting Linux and macOS
A modern, template-based, open source data transformation language
The formal proof of the Odd Order Theorem
- coq
- ssreflect
- mathcomp
- feit-thompson-theorem
annoy-rb provides Ruby bindings for the Annoy (Approximate Nearest Neighbors Oh Yeah).
- ruby
- approximate-nearest-neighbor-search
- nearest-neighbor-search
- gem
OCaml bindings to PCRE (Perl Compatibility Regular Expressions)
- ocaml
- pcre
- pattern-matching
- string-matching
Elixir library to do pipeable transformations on html strings (with CSS selectors)
- elixir
- html-parser
- html-renderer
- css-selector
Matplotlib for Elixir
Micromega tactics for Mathematical Components
- coq
- ssreflect
- mathcomp
- proof-automation
Implementation of books from Bourbaki's Elements of Mathematics in Coq [maintainer=@thery]
- coq
- bourbaki
- set-theory
- mathcomp
A compatible re-implementation of the BibTeX program in Common Lisp, with a BST-to-CL compiler. By Matthias Köppe