<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Convenient Category for Higher-Order Probability Theory · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1701.02547/</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/1701.02547/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Convenient Category for Higher-Order Probability Theory — mentioned by jesuslop</title><link>https://news.ycombinator.com/item?id=18314869</link><guid isPermaLink="false">urn:hackerpapers:mention:1701.02547:18314869</guid><pubDate>Sat, 27 Oct 2018 08:32:03 GMT</pubDate><description>&lt;p&gt;Chris Heunen and cols. have thought about a workaround to make probabilistic categories cartesian closed, and then Lambek translation from CCC to simply typed lambda calculus should apply, so Elliot machinery should also enable to express probablistic problems in Haskell terms. [1] https://arxiv.org/abs/1701.02547&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1701.02547/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item></channel></rss>
