Stars
Formal proof in Coq of Banach-Tarski paradox.
A dependently typed language with row polymorphism and extensible records
the next generation of the holbert proof assistant
⭐️ A friendly language for building type-safe, scalable systems!
A high performance and feature rich regular expression engine.