UniMath
coq-library-undecidability
| UniMath | coq-library-undecidability | |
|---|---|---|
| 2 | 2 | |
| 915 | 99 | |
| 1.0% | - | |
| 9.5 | 6.4 | |
| 1 day ago | 23 days ago | |
| Coq | Coq | |
| GNU General Public License v3.0 or later | Mozilla Public License 2.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
UniMath
-
Will Computers Redefine the Roots of Math?
For those interested in formalisation of homotopy type theory, there are several (more or less) active and developed libraries. To mention a few:
UniMath (https://github.com/UniMath/UniMath, mentioned in the article)
Coq-HoTT (https://github.com/HoTT/Coq-HoTT)
agda-unimath (https://unimath.github.io/agda-unimath/)
cubical agda (https://github.com/agda/cubical)
All of these are open to contributions, and there are lots of useful basic things that haven't been done and which I think would make excellent semester projects for a cs/math undergrad (for example).
-
Are There People Doing Formal Math In Berlin?
I just wonder if there are any irl meetups of people involved with formalizing mathematics, I thought that it would be a cool hobby to pick up (with some background in math and programming) but the existing libraries, like MathLib, TypeTopology or UniMath look a bit intimidating...
coq-library-undecidability
-
Development Environment with guix shell for Coq Package
I want to run guix shell to create an environment with the dependencies required to build coq-library-undecidability.
-
Math proof databases
There are two problems. The first is that there is no central repository. Sure, maybe if you're interested in undecidable results you might go here... But it's an island, and so is every other library. Worse yet, there's little inter mixing or combinable ways to use libraries. Unlike other programming languages, automated proof systems have so far been aimed at the technical aspects of a single person proving something, rather than the shareability of proofs.
What are some alternatives?
analysis - Mathematical Components compliant Analysis Library
Coq-Equations - A function definition package for Coq
math-comp - Mathematical Components
corn - Coq Repository at Nijmegen [maintainers=@spitters,@VincentSe]
Coq-HoTT - A Coq library for Homotopy Type Theory
verdi-raft - An implementation of the Raft distributed consensus protocol, verified in Coq using the Verdi framework
nqthm - nqthm - the original Boyer-Moore theorem prover, from 1992
TypeTopology - Logical manifestations of topological concepts, and other things, via the univalent point of view.
magmide - A dependently-typed proof language intended to make provably correct bare metal code possible for working software engineers.
hs-to-coq - Convert Haskell source code to Coq source code.
CompCert - The CompCert formally-verified C compiler