https://hackerpaper.kaipfister.de/p/1701.04391/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=14744167urn:hackerpapers:mention:1701.04391:14744167Tue, 11 Jul 2017 13:55:26 GMT<p>&gt; Having comparably powerful proof automation to Curry/Howard based systems is an open research problem. Isabelle/HOL is essentially isomorphic to a subset of Lean when we assume classical axioms, and any automation you can write for Isabelle, you can write for that subset of Lean. It is often easy to generalize automation techniques to support the rest of Lean (i.e. dependent types) as well, but sometimes doing so may introduce extra complexity or preclude the use of an indexing data structure. See https://arxiv.org/abs/1701.04391 for an example of generalizing a procedure (congruence…</p><p><a href="https://hackerpaper.kaipfister.de/p/1701.04391/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.LO