δ is for Dialectica
Abstract
Automatic Differentiation is the study of the efficient computation of differentials. While the first automatic differentiation algorithms are concomitant with the birth of computer science, the specific backpropagation algorithm has been brought to a modern light by its application to neural networks. This work unveils a surprising connection between backpropagation and Gödel's Dialectica interpretation, a logical translation that realizes semi-classical axioms. This unexpected correspondence is exploited through different logical settings. In particular, we show that the computational interpretation of Dialectica translates to the differential λ-calculus and that Differential Linear Logic subsumes the logical interpretation of Dialectica.
Ask Lune
Know this paper in minutes, not an afternoon.
Lune can read every page of it and the top-tier papers that cite it, and gives you its claims, its evidence and its limits, each one cited to the paper it comes from. No skimming, no AI slop.
2 top-tier papers have cited it since. Know what they found before your reviewers do.
Lune can draw on
the full paper · the top-tier papers that cite it · related work
Free to start. No credit card required.
Lineage
- You Only Linearize Once: Tangents Transpose to Gradients cites Backpropagation in the simply typed lambda-calculus with linear negation
- You Only Linearize Once: Tangents Transpose to Gradients cites A simple differentiable programming language
- JAX Autodiff from a Linear Logic Perspective cites You Only Linearize Once: Tangents Transpose to Gradients
- JAX Autodiff from a Linear Logic Perspective cites Backpropagation in the simply typed lambda-calculus with linear negation
- JAX Autodiff from a Linear Logic Perspective cites A simple differentiable programming language
- JAX Autodiff from a Linear Logic Perspective cites Efficient CHAD
- Efficient CHAD cites You Only Linearize Once: Tangents Transpose to Gradients
Cited by top-tier papers2
Builds on4
- A simple differentiable programming languageMartín Abadi, Gordon D. PlotkinPOPL 2020 · 49 citations
- Backpropagation in the simply typed lambda-calculus with linear negationAloïs Brunel, Damiano Mazza, Michele PaganiPOPL 2020 · 24 citations
- Taylor subsumes Scott, Berry, Kahn and PlotkinDavide Barbarossa, Giulio ManzonettoPOPL 2020 · 15 citations
- You Only Linearize Once: Tangents Transpose to GradientsAlexey Radul, Adam Paszke, Roy Frostig, Matthew J. Johnson et al.POPL 2023 · 13 citations
Related papers
- Taylor Expansion as a Monad in Models of DiLLMarie Kerjean, Jean-Simon Pacaud LemayLICS 2023 · 5 citations
- Provably correct, asymptotically efficient, higher-order reverse-mode automatic differentiationFaustyna Krawiec, Simon Peyton Jones, Neel Krishnaswami, Tom Ellis et al.POPL 2022 · 27 citations
- Compositional Taylor expansion in cartesian differential categoriesAymeric WalchLICS 2025
- On the complexity of nonsmooth automatic differentiationJérôme Bolte, Ryan Boustany, Edouard Pauwels, Béatrice Pesquet-PopescuICLR 2023
- The Gradient of Algebraic Model CountingJaron Maene, Luc De RaedtAAAI 2025 · 1 citation
