The formal proof of the Odd Order Theorem
- coq
- ssreflect
- mathcomp
- feit-thompson-theorem
47,133 repositories indexed
577–600 of 698 · Most stars
The formal proof of the Odd Order Theorem
annoy-rb provides Ruby bindings for the Annoy (Approximate Nearest Neighbors Oh Yeah).
Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [maintainer=@palmskog]
Use JavaScript to generate JavaScript
VCFloat: A Unified Coq Framework for Verifying C Programs with Floating-Point Computations
Partial Commutative Monoids
Erlang nif for xor_filter. 'Faster and Smaller Than Bloom and Cuckoo Filters'.
IO for Gallina
A powerful JavaScript functional programming toolset, including utility functions and abstract data structures.
Make functions return a channel for parallel processing via go routines.
The helper class for Visual Basic for Applications (VBA) 7.0, providing access to CLR (.NET Framework) assemblies and classes.
Common tools for projects
Chuck Norris Programming Language
Mutation analysis tool for Coq verification projects
Qurry (was) a prototype for a functional quantum programming language. It incorporated many aspects of functional programming (Haskell, Clojure), but also took standard design philosophies from C++, Python, and other "traditional" languages. [category: quantum]
Micromega tactics for Mathematical Components
Process pools for OCaml
An interpreter for C flat, a music-based programming language
An embeddable implementation of the Ngaro Virtual Machine for Go programs
A pool that spins up a given number of processes in advance and attaches stdin and stdout when needed. Very similar to FastCGI but works for any command.
Implementation of books from Bourbaki's Elements of Mathematics in Coq [maintainer=@thery]
Hahn: A Coq library
coinduction library for Coq
A compatible re-implementation of the BibTeX program in Common Lisp, with a BST-to-CL compiler. By Matthias Köppe