<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Profunctor Optics, a Categorical Update · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2001.07488/</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/2001.07488/feed.xml" rel="self" type="application/rss+xml" /><item><title>Profunctor Optics, a Categorical Update — mentioned by rssoconnor</title><link>https://news.ycombinator.com/item?id=33805923</link><guid isPermaLink="false">urn:hackerpapers:mention:2001.07488:33805923</guid><pubDate>Wed, 30 Nov 2022 19:08:27 GMT</pubDate><description>&lt;p&gt;Apologies for the jargon, but there isn&amp;#x27;t room in a comment box for a detailed explanation. &amp;quot;The Essence of the Iterator Pattern&amp;quot;[0] posed an open problem in type theory as to whether or not &amp;quot;lawful traversals&amp;quot;, of type `∀ F:Applicative. (X -&amp;gt; F X) -&amp;gt; (B -&amp;gt; F B)` could appear for anything other than what is called a &amp;quot;finitary container&amp;quot;[1], B := ∃S. X^(P S) where the (P S) is a natural number (or equivalently a polynomial functor B := ∃n. C_n * X^n). Or rather, there was an open question as to what laws are needed so that &amp;quot;lawful traversals&amp;quot; would imply that B is a finitary container.…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2001.07488/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item><item><title>Profunctor Optics, a Categorical Update — mentioned by hither_shores</title><link>https://news.ycombinator.com/item?id=31892334</link><guid isPermaLink="false">urn:hackerpapers:mention:2001.07488:31892334</guid><pubDate>Mon, 27 Jun 2022 09:30:34 GMT</pubDate><description>&lt;p&gt;There are infinitely many, so all is out, but the standard ones are covered here: https://oleg.fi/gists/posts/2017-04-18-glassery.html Page 10 of this paper has a table with references to some more exotic optics, though it&amp;#x27;s going to be hard to parse without some category theory: https://arxiv.org/pdf/2001.07488.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2001.07488/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item><item><title>Profunctor Optics, a Categorical Update — mentioned by dddbbb</title><link>https://news.ycombinator.com/item?id=22408492</link><guid isPermaLink="false">urn:hackerpapers:mention:2001.07488:22408492</guid><pubDate>Mon, 24 Feb 2020 21:10:24 GMT</pubDate><description>&lt;p&gt;Plenty of serious researchers in top universities are studying the intersection of mathematics and functional programming, and I don&amp;#x27;t think that they&amp;#x27;re somehow not &amp;#x27;real mathematicians&amp;#x27;. Here&amp;#x27;s a paper by the author of this post, formalising a popular Haskell pattern in category theory: https://arxiv.org/abs/2001.07488 EDIT: switched to non-PDF link.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2001.07488/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item><item><title>Profunctor Optics, a Categorical Update — HN submission</title><link>https://news.ycombinator.com/item?id=22204784</link><guid isPermaLink="false">urn:hackerpapers:submission:2001.07488:22204784</guid><pubDate>Fri, 31 Jan 2020 19:34:55 GMT</pubDate><description>&lt;p&gt;Profunctor Optics, a Categorical Update&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2001.07488/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item></channel></rss>
