<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Choice Trees: Representing Nondeterministic, Recursive, and Impure Programs in Coq · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2211.06863/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2211.06863/feed.xml" rel="self" type="application/rss+xml" /><item><title>Choice Trees: Representing Nondeterministic, Recursive, and Impure Programs in Coq — HN submission</title><link>https://news.ycombinator.com/item?id=33621077</link><guid isPermaLink="false">urn:hackerpapers:submission:2211.06863:33621077</guid><pubDate>Wed, 16 Nov 2022 10:32:41 GMT</pubDate><description>&lt;p&gt;Choice trees: Nondeterministic, recursive, and impure programs in Coq&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;56 points; 8 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2211.06863/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item></channel></rss>
