<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>When is a container a comonad? · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1408.5809/</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/1408.5809/feed.xml" rel="self" type="application/rss+xml" /><item><title>When is a container a comonad? — mentioned by whosthatguy</title><link>https://news.ycombinator.com/item?id=39400268</link><guid isPermaLink="false">urn:hackerpapers:mention:1408.5809:39400268</guid><pubDate>Fri, 16 Feb 2024 17:38:55 GMT</pubDate><description>&lt;p&gt;&amp;gt; 1. selects a sub-collection B of A whose elements match the path pattern β, &amp;gt; 2. computes a new collection C as a function f of B and its neighbors, &amp;gt; 3. and specifies the insertion of C in place of B into A. This sounds a lot like the presentation of comonads as directed containers (e.g. https://arxiv.org/abs/1408.5809).&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1408.5809/"&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>
