<story><title>Little Languages (1986) [pdf]</title><url>https://staff.um.edu.mt/afra1/seminar/little-languages.pdf</url></story><parent_chain></parent_chain><comment><author>ashton314</author><text>We are absolutely swimming in little languages. Consider these languages:&lt;p&gt;- The language of regular expressions&lt;p&gt;- SQL queries&lt;p&gt;- In web frameworks, the language of routes&lt;p&gt;- etc.&lt;p&gt;Unfortunately we embed a lot of these languages as strings. This is problematic because the language usually sees just opaque strings—we can&amp;#x27;t apply any of our lovely static analysis tools to these little embedded languages.&lt;p&gt;I&amp;#x27;m doing some research in this area. We just got a paper published at ECOOP. The big idea is that, with a little bit of clever metaprogramming, we can help the type checker understand these little languages better and give us more helpful hints or execute more efficiently. This isn&amp;#x27;t a new idea, but no one has given it a name before. Here&amp;#x27;s the blog post version: &lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;lambdaland.org&amp;#x2F;posts&amp;#x2F;2024-07-15_type_tailoring&amp;#x2F;&quot; rel=&quot;nofollow&quot;&gt;https:&amp;#x2F;&amp;#x2F;lambdaland.org&amp;#x2F;posts&amp;#x2F;2024-07-15_type_tailoring&amp;#x2F;&lt;/a&gt;&lt;p&gt;(HN discussion): &lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;news.ycombinator.com&amp;#x2F;item?id=40990232&quot;&gt;https:&amp;#x2F;&amp;#x2F;news.ycombinator.com&amp;#x2F;item?id=40990232&lt;/a&gt;</text></comment>
<story><title>Little Languages (1986) [pdf]</title><url>https://staff.um.edu.mt/afra1/seminar/little-languages.pdf</url></story><parent_chain></parent_chain><comment><author>dang</author><text>Related:&lt;p&gt;&lt;i&gt;“Little Languages” by Jon Bentley (1986) [pdf]&lt;/i&gt; - &lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;news.ycombinator.com&amp;#x2F;item?id=17881705&quot;&gt;https:&amp;#x2F;&amp;#x2F;news.ycombinator.com&amp;#x2F;item?id=17881705&lt;/a&gt; - Aug 2018 (17 comments)</text></comment>