With the discussion flaring up again, let me try to copy it to
discourse (using the email address above).
Regarding, what have people been doing to reach mathematicians. Let me
mention a few initiatives:
https://mapcommunity.github.io/https://wiki.portal.chalmers.se/cse/pmwiki.php/ForMath/ForMathNewton Institute:
https://www.newton.ac.uk/event/bprIAS:
https://www.math.ias.edu/sp/univalentIHP:
https://ihp2014.pps.univ-paris-diderot.fr/doku.phphttps://github.com/UniMath/SymmetryBookMoreover, I believe Egbert Rijke has a point:"
- Our communities are simply too small
- Our papers don't get published unless they're about new stuff. "The
definition of a scheme in Coq" doesn't get favorable reviews.
- We *do* some fashonable maths: higher topos theory, higher group
theory, some big theorems..."
https://twitter.com/EgbertRijke/status/1226948002654380033?s=20On Thu, Jan 9, 2020 at 7:02 AM Bas Spitters <
b.a.w.s...@gmail.com> wrote:
Dear Kevin,
Thank you for your clarifications.
Let me try to see if I understand, you seem to be saying that lean
would have little advantages over coq for discrete mathematics such as
used in the Feit-Thompson theorem. In particular, the automation of
lean is not much stronger than that of Coq.
However, for classical real analysis you seem to be saying that native
quotients and choice have a big advantage. Here it is possible to make
a good comparison between the coq stdlib reals, coquelicot and
math-comp analysis on the one side and lean's math-lib on the other
side.
Could you explain how native choice/PEM is much preferable over a
choice *axiom* as is used in e.g. math-comp analysis.
https://github.com/math-comp/analysis
http://coquelicot.saclay.inria.fr/
Obvious differences with math-comp analysis are:
IIUC lean has dropped canonical structures and has a type class system
that is slightly different from Coq's. Moreover, lean's proof language
is more verbose than Coq's Ltac and in particular SSR.
Best wishes,
Bas