<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Polymorphic Records for Dynamic Languages · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2404.00338/</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/2404.00338/feed.xml" rel="self" type="application/rss+xml" /><item><title>Polymorphic Records for Dynamic Languages — mentioned by noelwelsh</title><link>https://news.ycombinator.com/item?id=41044507</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.00338:41044507</guid><pubDate>Tue, 23 Jul 2024 10:25:01 GMT</pubDate><description>&lt;p&gt;I think what you describe is called &amp;quot;extensible records&amp;quot;. Elm had them in a prior version. You can implement them in a language with an expressive enough type system (e.g. Haskell or Scala) without special support, but the syntax can be a bit unwieldy. Here&amp;#x27;s three recent papers on extensible records: * https://arxiv.org/pdf/2108.06296 * https://arxiv.org/pdf/2404.00338 * https://dl.acm.org/doi/pdf/10.1145/3571224 I&amp;#x27;m not claiming these are definitive in any sense, but they are useful guides into the literature if any reader wants to learn more. (If you are not used to reading programming…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.00338/"&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>
