<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>String diagrams for Strictification and Coherence · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2201.11738/</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/2201.11738/feed.xml" rel="self" type="application/rss+xml" /><item><title>String diagrams for Strictification and Coherence — mentioned by statusfailed</title><link>https://news.ycombinator.com/item?id=45344093</link><guid isPermaLink="false">urn:hackerpapers:mention:2201.11738:45344093</guid><pubDate>Tue, 23 Sep 2025 07:57:23 GMT</pubDate><description>&lt;p&gt;Really nice! Had a quick read, here&amp;#x27;s my quick summary: - Arrays are typed `S : D` with shape S and strides D - Each of `S` and `D` is a nested tuple (instead of the flat tuples one typically sees in a tensor framework) - Together `S` and `D` define the layout of a tensor - Not every layout is &amp;quot;tractable&amp;quot;, but the tractable ones form a nice category A really good exposition, my only criticism is that it&amp;#x27;s quite front-heavy- it would be nice to see a detailed example like in 2.3.8 earlier in the document; there is a lot of detail presented early that doesn&amp;#x27;t seem necessary to understand the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2201.11738/"&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>
