<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Higher-Order, Data-Parallel Structured Deduction · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2211.11573/</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.11573/feed.xml" rel="self" type="application/rss+xml" /><item><title>Higher-Order, Data-Parallel Structured Deduction — mentioned by kmicinski</title><link>https://news.ycombinator.com/item?id=38525790</link><guid isPermaLink="false">urn:hackerpapers:mention:2211.11573:38525790</guid><pubDate>Tue, 05 Dec 2023 01:22:14 GMT</pubDate><description>&lt;p&gt;Yeah, IncA (compiling to Souffle) and Ascent (I believe Crepe is not parallel, though also a good engine) are two other relevant cites here. Apropos linked data, our group has an MPI-based engine which is built around linked facts (subsequently enabling defunctionalization, ad-hoc polymorphism, etc..), which is very reminiscent of the discussion in the first link of yours: https://arxiv.org/abs/2211.11573&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2211.11573/"&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>Higher-Order, Data-Parallel Structured Deduction — mentioned by philzook</title><link>https://news.ycombinator.com/item?id=35619822</link><guid isPermaLink="false">urn:hackerpapers:mention:2211.11573:35619822</guid><pubDate>Tue, 18 Apr 2023 20:44:44 GMT</pubDate><description>&lt;p&gt;You might find these also interesting - Higher-Order, Data-Parallel Structured Deduction https://arxiv.org/pdf/2211.11573.pdf - Functional Programming with Datalog https://drops.dagstuhl.de/opus/volltexte/2022/16235/pdf/LIPI... - A Systematic Approach to Deriving Incremental Type Checkers https://www.pl.informatik.uni-mainz.de/files/2020/10/increme...&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2211.11573/"&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>
