The Rocq Prover is an interactive theorem prover, or proof assistant. It provides a formal language to write mathematical definitions, executable algorithms and theorems together with an environment for semi-interactive development of machine-checked proofs.
📜🔜🌲 Simple, fast, powerful parser toolkit for JavaScript.
- parser
- earley-algorithm
- earley-parser
- javascript
Up to 100x faster strings for C, C++, CUDA, Python, Rust, Swift, JS, & Go, leveraging NEON, AVX2, AVX-512, SVE, GPGPU, & SWAR to accelerate search, hashing, sorting, edit distances, sketches, and memory ops 🦖
Curated list of open-source quantum software projects.
🤠 Object property paths with wildcards and regexps 🌵
Lossless compression C library built for ultra-fast decode. Faster than LZ4 (+35% to 105%+; best on ARM64), at a better ratio. Official Rust, Python, Node.js, Go and WASM bindings. Write-once/read-many, with optional seekable archives for O(1) random access.
A Library to parse natural language in pure Clojure and ClojureScript
A collection of containers & algorithms for the Crystal programming language
Various algorithms visualized interactively on the web, entirely with Rust 🦀
Parameter Optimization for Lean Algorithms
Permutations and permutation groups in Common Lisp.
- permutations
- permutation-groups
- permutation-algorithms
- lisp
Functional Data Structures and Algorithms in SSReflect [maintainer=@clayrat]
- coq
- mathcomp
- 2-3-tree
- avl-tree
NASA/JPL SPICE Toolkit for C – patched for cross-platform compatibility
- astronomy
- astronomical-algorithms
- celestial-mechanics
- nasa
Stable sort algorithms and their stability proofs in Rocq
- mathcomp
- ssreflect
- sorting-algorithms
- mergesort
Coq library for reasoning on randomized algorithms [maintainers=@anton-trunov,@volodeyka]
- coq
- randomized-algorithms
- probability
- monad
A library for verifying graph-manipulating programs. Powered by Coq and VST. Compatible with CompCert.
- coq
- vst
- compcert
- graph-algorithms
Coq formalization of algorithms due to Tarjan and Kosaraju for finding strongly connected graph components using Mathematical Components and SSReflect [maintainers=@CohenCyril,@palmskog]
- coq
- mathcomp
- ssreflect
- tarjan-algorithm
Implementation of the Rendezvous or Highest Random Weight (HRW) hashing algorithm in the Elixir Programming Language
Extra contribution for mathcomp
- theorem-proving
- primality-test
- matroid
- rsa-algorithm