<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Linearly Qualified Types: Generic inference for capabilities and uniqueness · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2103.06127/</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/2103.06127/feed.xml" rel="self" type="application/rss+xml" /><item><title>Linearly Qualified Types: Generic inference for capabilities and uniqueness — mentioned by whateveracct</title><link>https://news.ycombinator.com/item?id=26863679</link><guid isPermaLink="false">urn:hackerpapers:mention:2103.06127:26863679</guid><pubDate>Mon, 19 Apr 2021 15:17:33 GMT</pubDate><description>&lt;p&gt;&amp;gt; As a more general comment, using a GC language as the FFI target from a GC language is begging for difficult-if-not-impossible-to-debug crashes down the line. Safe interop between two GC&amp;#x27;d languages (Haskell and Java) was one motivation of Haskell&amp;#x27;s new -XLinearTypes extension https://www.tweag.io/blog/2020-02-06-safe-inline-java/ Generally, the new linear types are exciting but are nascent at the moment. But one extension to them (linear constraint [1]) seems to allow embed the equivalent of Rust&amp;#x27;s ownership in Hsakell using more primitive features in the type system (to my…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2103.06127/"&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>
