https://hackerpaper.kaipfister.de/p/2005.08856/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=41148925urn:hackerpapers:mention:2005.08856:41148925Sat, 03 Aug 2024 20:11:00 GMT<p>Maciej Bendkowski has some related work [1] on generating random lambda terms, but was unable to overcome what he calls the asymptotic sparsity problem: Sampling simply-typed terms seems notoriously more challenging than sampling closed ones. Even rejection sampling, whenever applicable, admits serious limitations due to the imminent asymptotic sparsity problem — asymptotically almost no term, be it either plain or closed, is at the same time (simply) typeable. [...] Asymptotic sparsity of simply-typed λ-terms is an impenetrable barrier to rejection sampling techniques. As the term size tends…</p><p><a href="https://hackerpaper.kaipfister.de/p/2005.08856/">Paper and discussion history</a>. A mention is not an endorsement.</p>math.CO