<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Programs as Diagrams: From Categorical Computability to Computable Categories · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2208.03817/</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/2208.03817/feed.xml" rel="self" type="application/rss+xml" /><item><title>Programs as Diagrams: From Categorical Computability to Computable Categories — mentioned by tern</title><link>https://news.ycombinator.com/item?id=48886944</link><guid isPermaLink="false">urn:hackerpapers:mention:2208.03817:48886944</guid><pubDate>Mon, 13 Jul 2026 01:55:35 GMT</pubDate><description>&lt;p&gt;1. A compiler for real-time tensor processing (arbitrary DSP, ML). In something like LISP or Haskell, the goal is to compile lambda calculus for fast/reliable execution—as such, you can express a program in a fully general language that can represent any computation and execute it without explicitly modeling the lower levels of the machine. I&amp;#x27;m building a compiler that does the same thing for the subset of programs that are guaranteed to execute on-budget. The effect: you write code that looks like DSP/ML math and it compiles/runs optimally with execution guaranteed by construction. 2. My…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2208.03817/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LO</category></item><item><title>Programs as Diagrams: From Categorical Computability to Computable Categories — HN submission</title><link>https://news.ycombinator.com/item?id=38158127</link><guid isPermaLink="false">urn:hackerpapers:submission:2208.03817:38158127</guid><pubDate>Mon, 06 Nov 2023 02:35:03 GMT</pubDate><description>&lt;p&gt;Programs as Diagrams: From Categorical Computability to Computable Categories&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;20 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2208.03817/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LO</category></item></channel></rss>
