You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
So now that @Jules Hedges has asked the Twitter hivemind about machine learning (ML) applied to automated theorem proving (ATP), I thought I'd make a new topic in #applied category theory to discuss. @Bruno Gavranovic
Guillermo pointed out this early paper by Christian Szegedy et co.
@_julesh_ I've seen many works on that vein. This is one of the earliest https://arxiv.org/abs/1606.04442
- Guillermo Valle (@guillefix)Another paper by Szegedy et co in 2017 uses Mizar.
This paper (Proverbot9001) from UCSD uses Coq.
On the Lean theorem prover Zulip instance we have a stream dedicated to this topic. I'm not sure what will happen if I post a link, but I'll try anyways:
https://leanprover.zulipchat.com/#narrow/stream/219941-Machine-Learning.20for.20Theorem.20Proving
Reid Barton said:
On the Lean theorem prover Zulip instance we have a stream dedicated to this topic. I'm not sure what will happen if I post a link, but I'll try anyways:
https://leanprover.zulipchat.com/#narrow/stream/219941-Machine-Learning.20for.20Theorem.20Proving
Thanks! Looks like I'd have to get on board then.
This topic in that stream is good: https://leanprover.zulipchat.com/#narrow/stream/219941-Machine-Learning.20for.20Theorem.20Proving/topic/Paper.3A.20Tactic.20Learning.20and.20Proving.20for.20the.20Coq.20Proof.20Assista
So there are now three ML bots for Coq:
I guess it might be interesting to see what we can learn by using CT to study those machine learning architectures.