https://hackerpaper.kaipfister.de/p/1809.03094/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=23215599urn:hackerpapers:mention:1809.03094:23215599Sun, 17 May 2020 21:22:04 GMT<p>There are a number of different type theory models for classical logic. The first to my knowledge was a model that uses the call-with-current-continuation (call/cc) control flow operator. While this does model classical logic, some say it is not particularly useful as a practical programming construct, which is perhaps why it does not seem to be adopted by any major proof assistant. More recently I&#x27;ve seen a few papers showing that type theoretic models of concurrency can also model classical logic, e.g. see &quot;Classical Proofs as Parallel Programs&quot; &lt; https://arxiv.org/abs/1809.03094 &gt;. The…</p><p><a href="https://hackerpaper.kaipfister.de/p/1809.03094/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.LO