<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>About the efficient reduction of lambda terms · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1701.04240/</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/1701.04240/feed.xml" rel="self" type="application/rss+xml" /><item><title>About the efficient reduction of lambda terms — mentioned by fritzo</title><link>https://news.ycombinator.com/item?id=30225142</link><guid isPermaLink="false">urn:hackerpapers:mention:1701.04240:30225142</guid><pubDate>Sat, 05 Feb 2022 19:54:30 GMT</pubDate><description>&lt;p&gt;Great work Victor, it&amp;#x27;s so encouraging to see Asperti &amp;amp; Guerrini&amp;#x27;s research receive engineering attention! Anton Salikhmetov also had some nice implementations [1] a few years ago. As I understand, even Andrea Asperti didn&amp;#x27;t believe his approach was practical [2] :) Any idea how hard it would be to extend with a nondeterminism operator, as in Plotkin&amp;#x27;s parallel or? (fork a computation and terminate if either branch terminates) [1] https://dblp.org/pid/49/4772.html [2] https://arxiv.org/abs/1701.04240&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1701.04240/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LO</category></item></channel></rss>
