Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs · HackerPapers discussions

Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs — mentioned by sbierwagen

Sun, 28 Jul 2024 20:34:03 GMT

>Then ask it to convert the problem into each of those formal methods. Then use something like Mathematica on each formal method. Draft, Sketch, and Prove from 2022 does something like this: https://arxiv.org/abs/2210.12283

Paper and discussion history. A mention is not an endorsement.

Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs — HN submission

Wed, 26 Oct 2022 06:42:21 GMT

Ask HN: Proof Irrelevance and De Morgan's Laws

I'm reading two things at the same time 99 Variations on a Proof https://press.princeton.edu/books/hardcover/9780691158839/99... and the newly published paper Draft, Sketch, and Prove: Guiding Formal Theorem Provers With Informal Proofs https://arxiv.org/pdf/2210.12283.pdf As you all know De Morgan's Laws provide great simplification of terms to canonical forms. Application of these laws improved circuit design forever. My question: Can "Irrelevance Laws" be developed in proofs so one style of proof can be mechanically converted to another style? If so, can a system like LEAN convert the…

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs — HN submission

Tue, 25 Oct 2022 16:08:34 GMT

Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.