Lune

POPL2026Top-tier venue

JAX Autodiff from a Linear Logic Perspective

Giulia Giusti, Michele Pagani

Abstract

JAX Autodiff refers to the core of the automatic differentiation (AD) systems developed in projects like JAX and Dex. JAX Autodiff has recently been formalised in a linear typed calculus by Radul et al in POPL 2023. Although this formalisation suffices to express the main program transformations of AD, the calculus is very specific to this task, and it is not clear whether the type system yields a substructural logic that has interest on its own. We propose an encoding of JAX Autodiff into a linear λ- calculus that enjoys a Curry-Howard correspondence with Girard’s linear logic. We prove that the encoding is sound both qualitatively (the encoded terms are extensionally equivalent to the original ones) and quantitatively (the encoding preserves the original work cost as described by Radul et al. As a byproduct, we show that unzipping, one of the transformations used to implement backpropagation in JAX Autodiff, is, in fact, optional.

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.

Questions to start from

Lune can draw on

the full paper · related work

Get the answer

Free to start. No credit card required.

Lineage

  • You Only Linearize Once: Tangents Transpose to Gradients cites Provably correct, asymptotically efficient, higher-order reverse-mode automatic differentiation
  • You Only Linearize Once: Tangents Transpose to Gradients cites Automatic differentiation in PCF
  • 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
  • Provably correct, asymptotically efficient, higher-order reverse-mode automatic differentiation cites Automatic differentiation in PCF
  • Provably correct, asymptotically efficient, higher-order reverse-mode automatic differentiation cites Backpropagation in the simply typed lambda-calculus with linear negation
  • Provably correct, asymptotically efficient, higher-order reverse-mode automatic differentiation cites A simple differentiable programming language
  • Automatic differentiation in PCF cites Backpropagation in the simply typed lambda-calculus with linear negation
  • Automatic differentiation in PCF cites A simple differentiable programming language
Builds onCited byLeft to right by year; the more cited, the higher.

Builds on8

  1. A simple differentiable programming languageMartín Abadi, Gordon D. PlotkinPOPL 2020 · 49 citations
  2. Automatic differentiation in PCFDamiano Mazza, Michele PaganiPOPL 2021 · 47 citations
  3. Provably correct, asymptotically efficient, higher-order reverse-mode automatic differentiationFaustyna Krawiec, Simon Peyton Jones, Neel Krishnaswami, Tom Ellis et al.POPL 2022 · 27 citations
  4. Backpropagation in the simply typed lambda-calculus with linear negationAloïs Brunel, Damiano Mazza, Michele PaganiPOPL 2020 · 24 citations
  5. You Only Linearize Once: Tangents Transpose to GradientsAlexey Radul, Adam Paszke, Roy Frostig, Matthew J. Johnson et al.POPL 2023 · 13 citations

Related papers

  1. δ is for DialecticaMarie Morgane Kerjean, Pierre-Marie PédrotLICS 2024 · 1 citation
  2. Automatic Functional Differentiation in JAXMin LinICLR 2024 · 5 citations
  3. A Simple and Efficient Tensor CalculusSören Laue, Matthias Mitterreiter, Joachim GiesenAAAI 2020 · 40 citations
  4. Compositional Taylor expansion in cartesian differential categoriesAymeric WalchLICS 2025
  5. Fuzzing Automatic Differentiation in Deep-Learning LibrariesChenyuan Yang, Yinlin Deng, Jiayi Yao, Yuxing Tu et al.ICSE 2023 · 34 citations
Dusk over the sea between two cliffs drawn in fine vertical lines