I personally prefer Agda to Lean or Coq [1] to prove my theorems but this frontier is imho among the most exciting research in theoretical CS in many many decades. I really wish more programmers and mathematicians knew about automated theorem proving and automated reasoning. It's nothing short of revolutionary and I think next generation of pure mathematicians will use these as a crucial tool in their research. [1] I…
Oh, really? I'm curious what exactly you mean by limitless metaprogramming. I've really been drawn into Lean specifically because of how easy to extend and malleable the language itself is, so if Agda is even more so then I'd be really eager to try that out. e.g.: - embedding a prolog/asp DSL: https://github.com/kiranandcode/cleango - embedding a tex/latex DSL: https://github.com/kiranandcode/LeanTeX
How to (actually) prove it – New Frontiers of Mathematics and Computing in Lean
11–18 of 18 posts
Re: How to (actually) prove it – New Frontiers of Mathematics and Computing in Lean
#12Interesting. I always wanted to try Lean, and personally never found an easy way to do it, as it requires installing a plugin in vscode, create a project or reading the lean book. But following the links I've found this nice interactive tutorial for proving 2+2=4 in Peano arithmetic: https://adam.math.hhu.de/#/g/leanprover-community/nng4/ It's quite instructive.
Lean is more complex to develop in than most programming languages since it relies heavily on interactive programming, i.e. the context pane. The "easy way" is with a plugin. If you're interested in learning more about Lean for writing proofs, I would recommend The Mechanics of Proof [0]. It strips out a lot of the convenience tactics in Mathlib to focus on the more primitive mechanisms Mathlib builds on. [0]: https:…
The natural number's game is actually quite fun, and I did understand much better the language. And it's also interactive, so you can try your solutions, and there are hints when stuck.
Re: How to (actually) prove it – New Frontiers of Mathematics and Computing in Lean
#13I personally prefer Agda to Lean or Coq [1] to prove my theorems but this frontier is imho among the most exciting research in theoretical CS in many many decades. I really wish more programmers and mathematicians knew about automated theorem proving and automated reasoning. It's nothing short of revolutionary and I think next generation of pure mathematicians will use these as a crucial tool in their research. [1] I…
Re: How to (actually) prove it – New Frontiers of Mathematics and Computing in Lean
#14I think this is all very exciting but I also think ergonomics will probably need to improve quite a bit before Lean will become mainstream in mathematics.
Re: How to (actually) prove it – New Frontiers of Mathematics and Computing in Lean
#15Re: How to (actually) prove it – New Frontiers of Mathematics and Computing in Lean
#16[flagged]
Re: How to (actually) prove it – New Frontiers of Mathematics and Computing in Lean
#17Re: How to (actually) prove it – New Frontiers of Mathematics and Computing in Lean
#18Earlier quoted context omitted.
did you read the wrong article?
[flagged]
> “ Of course, mathematicians gain a lot by doing this1, machine checked proofs reduce..”
This sentence is grammatical, the 1 is just a footnote (which you can click) - this could be improved typographically, I suppose. The rest are just minor mistakes - "are promising to", "with the Lean Theorem prover", "to non-mathematicians".