UniMath
hs-to-coq
UniMath | hs-to-coq | |
---|---|---|
2 | 2 | |
915 | 74 | |
1.0% | - | |
9.5 | 0.0 | |
1 day ago | about 1 month ago | |
Coq | Coq | |
GNU General Public License v3.0 or later | MIT License |
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...
hs-to-coq
-
Do you use Idris or Coq, and why?
There is even a project that converts Haskell to Coq.
-
agda2hs, verify your haskell code in agda?
PS: Obligatory plug for hs-to-coq.
What are some alternatives?
analysis - Mathematical Components compliant Analysis Library
principia - The Principia Rewrite
math-comp - Mathematical Components
Agda - Agda is a dependently typed programming language / interactive theorem prover.
Coq-HoTT - A Coq library for Homotopy Type Theory
notes
nqthm - nqthm - the original Boyer-Moore theorem prover, from 1992
CompCert - The CompCert formally-verified C compiler
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.
coq-library-undecidability - A library of mechanised undecidability proofs in the Coq proof assistant.
agda2hs - Compiling Agda code to readable Haskell