<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A type theory for synthetic $\infty$-categories · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1705.07442/</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/1705.07442/feed.xml" rel="self" type="application/rss+xml" /><item><title>A type theory for synthetic $\infty$-categories — mentioned by armchairhacker</title><link>https://news.ycombinator.com/item?id=38236174</link><guid isPermaLink="false">urn:hackerpapers:mention:1705.07442:38236174</guid><pubDate>Sun, 12 Nov 2023 00:52:39 GMT</pubDate><description>&lt;p&gt;Reminds me of &amp;quot;rzk: an experimental proof assistant for synthetic ∞-categories&amp;quot; (https://rzk-lang.github.io/rzk/v0.6.4/reference/introduction...) and the ∞-categories paper (https://arxiv.org/abs/1705.07442)&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1705.07442/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.CT</category></item></channel></rss>
