<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Data-Codata Symmetry and its Interaction with Evaluation Order · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2211.13004/</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/2211.13004/feed.xml" rel="self" type="application/rss+xml" /><item><title>Data-Codata Symmetry and its Interaction with Evaluation Order — mentioned by noelwelsh</title><link>https://news.ycombinator.com/item?id=36874830</link><guid isPermaLink="false">urn:hackerpapers:mention:2211.13004:36874830</guid><pubDate>Wed, 26 Jul 2023 08:58:28 GMT</pubDate><description>&lt;p&gt;Sum types + pattern matching (algebraic data types + structural recursion) achieves the same goal as what the author describes, but uses a different implementation technique. In functional programming there is often talk of &amp;quot;duality&amp;quot;. Two things are dual if you can make an exact correspondence between them. In this case, these two implementation techniques are duals. The OO technique is known as &amp;quot;codata&amp;quot;, which, as you say, is all about having a uniform protocol to interact with. (In this case, the method &amp;quot;eval&amp;quot;.) The FP technique is just &amp;quot;data&amp;quot;, which is basically interchangeable with sum…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2211.13004/"&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>
