- Author
- Posted by jy14898, with replies from many commenters
- Published
- 24 November 2025
- Kind
- Hacker News discussion thread
- Original
- news.ycombinator.com/item?id=46039106
- Subject
- Programming languages and types
What it is
Jy14898 posted the link and many users replied. The site accompanies a paper on Delta-Nets, a graph-based way to reduce lambda terms. The thread debates its credibility and explains its ideas.
What it says
- Commenter qsort doubts the paper, citing no affiliation, a bold abstract and implicit theorems.
- The paper author, danaugrs, says Levy and Lamping also used the term lambda reduction.
- Danaugrs says the aim was to implement Lamping's algorithm without delimiter nodes, using interaction nets.
- Commenter tromp says the paper streamlines optimal reduction with replicators instead of separate bookkeeping gadgets.
- Commenter etiamz says missing proofs and benchmarks make the contributions debatable.
- Commenter marvinborner says the novelty is a new, better explained bookkeeping mechanism, unlike HVM's subset.
- Commenter csense says users write a term, view its graph and click to reduce.
What evidence it gives
The thread offers argument, explanation and links. The paper author replies in person. No commenter reports benchmarks.
Interests and limits
The site and the paper were not read for this page. Several commenters admit they cannot judge the content. The paper author has an interest in the work being well received.