<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Bidirectional Typing · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1908.05839/</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/1908.05839/feed.xml" rel="self" type="application/rss+xml" /><item><title>Bidirectional Typing — mentioned by withoutboats3</title><link>https://news.ycombinator.com/item?id=40662185</link><guid isPermaLink="false">urn:hackerpapers:mention:1908.05839:40662185</guid><pubDate>Wed, 12 Jun 2024 19:45:04 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;m suspicious about the truth of this claim. I don&amp;#x27;t think bidirectional typechecking is the problem in itself: the problem trying to do type inference when you have some extremely flexible operator overloading, subtyping, and literal syntax features. It&amp;#x27;s these &amp;quot;expressive&amp;quot; features which have made type inference in Swift far more computationally complex, not type inference itself. And certainly not bidirectional type inference; the author of this post&amp;#x27;s definition of this concept isn&amp;#x27;t even right (bidirectional typing refers to having a distinction between typing judgements which are used…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1908.05839/"&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>Bidirectional Typing — mentioned by cultus</title><link>https://news.ycombinator.com/item?id=23796232</link><guid isPermaLink="false">urn:hackerpapers:mention:1908.05839:23796232</guid><pubDate>Fri, 10 Jul 2020 20:43:40 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;ve been really enamored of bidirectional type systems [0] lately, which seem to really give the best of all worlds. They explicitly separate inference from type checking, with the type checker switching between both modes during checking/inference. It&amp;#x27;s also more syntax directed, which makes good error messages easy. A pure HM type-system is pretty restrictive, so most ML family languages don&amp;#x27;t have global type inference anyway. [0] https://arxiv.org/pdf/1908.05839.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1908.05839/"&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>Bidirectional Typing — HN submission</title><link>https://news.ycombinator.com/item?id=20792398</link><guid isPermaLink="false">urn:hackerpapers:submission:1908.05839:20792398</guid><pubDate>Sun, 25 Aug 2019 11:33:47 GMT</pubDate><description>&lt;p&gt;Bidirectional Typing&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/1908.05839/"&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>
