lean
daisy-nfsd
Our great sponsors
lean | daisy-nfsd | |
---|---|---|
4 | 1 | |
1,915 | 27 | |
- | - | |
0.0 | 7.7 | |
over 3 years ago | 3 months ago | |
C++ | Dafny | |
Apache License 2.0 | 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.
lean
-
Paper from 2021 claims P=NP with poorly specified algorithm for maximum clique using dynamical systems theory
Apparently, it even still segfaulted in 2018 https://github.com/leanprover/lean/issues/1958. I don't expect my tools to segfault.
-
Low-level format file of mathlib
Does anyone happen to have the mathlib library in the [low-level format](https://github.com/leanprover/lean/blob/master/doc/export_format.md)? I've been trying to run lean --export to obtain it, but I keep getting various errors.
-
Mathematics: our overlooked ability
I have spent a good deal of time trying to formalize elementary mathematics and computer science textbooks in the Lean Theorem Prover, and in trying to extend and improve Lean to make the process easier. I have been able to translate entire chapters of several textbooks into Lean in a natural way, with every line of Lean seemingly isomorphic to the informal presentation. However, once in a while I will hit a statement or proof step that may seem simple to me but that requires a major refactor, or adding new features to Lean itself, or just seems like a brick wall. My brain is able to perform massive refactorings of mathematical knowledge and abstractions, synthesize the equivalent of tens of thousands of lines of tricky and performance-critical software, and maybe even expand the logic I am effectively operating in, all in the blink of an eye.
-
How do I get back into math?
However, mathlib makes some weird design choices. For example, (semi)groups are defined using multiplicative notation -- and then immediately followed by an entire section giving the exact same definitions using additive notation! The claimed reason for this is that the more abstract approach is inconvenient for automation. I did it in Coq using the abstract approach, and indeed, noticed that doing so broke automation, which I then worked around in various ways. But it's just weird to me as a mathematician to have additive and multiplicative groups be different objects, so I wouldn't want to do it the Lean way come hell or high water. The Lean approach causes practical difficulties as well: you have to prove every theorem about groups twice. In some cases (e.g. product groups), you have to prove every theorem FOUR times. Ugh.
daisy-nfsd
What are some alternatives?
Agda - Agda is a dependently typed programming language / interactive theorem prover.
tlaplus - TLC is a model checker for specifications written in TLA+. The TLA+Toolbox is an IDE for TLA+.
FStar - A Proof-oriented Programming Language
owasp-masvs - The OWASP MASVS (Mobile Application Security Verification Standard) is the industry standard for mobile app security.
Coq-HoTT - A Coq library for Homotopy Type Theory
immudb - immudb - immutable database based on zero trust, SQL/Key-Value/Document model, tamperproof, data change history
CoqGym - A Learning Environment for Theorem Proving with the Coq proof assistant
mockk - mocking library for Kotlin
arend-lib
llm-verified-with-monte-carlo-tree-search - LLM verified with Monte Carlo Tree Search
ttlite - A SuperCompiler for Martin-Löf's Type Theory
OEISbot - Automatically posts links to OEIS sequences on Reddit