Papers › Δ-Nets: Interaction-Based System for Optimal Parallel λ-Reduction
Δ-Nets: Interaction-Based System for Optimal Parallel λ-Reduction
Daniel Augusto Rizzi Salvadori
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
I present a model of universal parallel computation called Δ-Nets, and a method to translate λ-terms into Δ-nets and back. Together, the model and the method constitute an algorithm for optimal parallel λ-reduction, solving the longstanding enigma with groundbreaking clarity. I show that the λ-calculus can be understood as a projection of Δ-Nets$-$one that severely restricts the structure of sharing, among other drawbacks. Unhindered by these restrictions, the $\Delta$-Nets model opens the door to new parallel programming language implementations and computer architectures that are more efficient and performant than previously possible.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections