Hostname: page-component-76d6cb85b7-92wsb Total loading time: 0 Render date: 2026-07-24T22:12:10.862Z Has data issue: false hasContentIssue false
  • English
  • Français

From differential linear logic to coherent differentiation

Published online by Cambridge University Press:  07 April 2026

Thomas Ehrhard Open the ORCID record for Thomas Ehrhard [Opens in a new window]
Thomas Ehrhard*
Affiliation:
Université Paris Cité , CNRS, Inria, IRIF, F-75013, Paris, France
*
Email: thomas.ehrhard@inria.fr
Get access Rights & Permissions [Opens in a new window]

Abstract

In thise survey, we present in a unified way the categorical and syntactical settings of coherent differentiation introduced recently, which shows that the basic ideas of differential linear logic and of the differential lambda-calculus are compatible with determinism. Indeed, due to the Leibniz rule of the differential calculus, differential linear logic and the differential lambda-calculus feature an operation of addition of proofs or terms operationally interpreted as a strong form of nondeterminism. The main idea of coherent differentiation is that the summations required by differentiation can be controlled and kept deterministic, in the denotational models, as well as in the syntax and operational semantics themselves. In sharp contrast with the differential lambda-calculus, coherent differentiation indeed allows one to design differential extensions of Turing complete functional programming languages, such as PCF, endowed with a deterministic evaluation mechanism, typically implemented in a Krivine abstract machine.

Keywords

Denotational semanticslinear logicdifferential lambda-calculus

Information

Type
Special Issue: Differential Structures
Information
Mathematical Structures in Computer Science , Volume 35 , 2025 , e41
Check for updates
Copyright
© The Author(s), 2026. Published by Cambridge University Press.

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Barr, M. (1979). *-Autonomous Categories, Number 752 in Lecture Notes in Mathematics. Springer-Verlag.10.1007/BFb0064579CrossRefGoogle Scholar
Blute, R. F., Cockett, J. R. B. and Seely, R. A. G. (2009). Cartesian differential categories. Theory and Applications of Categories 22 622–672.10.70930/tac/y9rglypbCrossRefGoogle Scholar
Boudes, P. (2011). Non-uniform (hyper/multi)coherence spaces. Mathematical Structures in Computer Science 21 (1) 1–40.10.1017/S0960129510000320CrossRefGoogle Scholar
Bucciarelli, A. and Ehrhard, T. (2001). On phase semantics and denotational semantics: the exponentials. Annals of Pure and Applied Logic 109 (3) 205–241.10.1016/S0168-0072(00)00056-7CrossRefGoogle Scholar
Cockett, J. R. B. and Cruttwell, G. S. H. (2014). Differential structure, tangent structure, and SDG. Applied Categorical Structures 22 (2) 331–417.10.1007/s10485-013-9312-0CrossRefGoogle Scholar
Crubillé, R., Ehrhard, T., Pagani, M. and Tasson, C. (2017). The free exponential modality of probabilistic coherence spaces. In: Esparza, J. and Murawski, A. S. (eds.) Foundations of Software Science and Computation Structures - 20th International Conference, FOSSACS (2017), Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, vol. 10203 of Lecture Notes in Computer Science, 20–35.Google Scholar
Danos, V. and Ehrhard, T. (2011). Probabilistic coherence spaces as a model of higher-order probabilistic computation. Information and Computation 209 (6) 966–991.10.1016/j.ic.2011.02.001CrossRefGoogle Scholar
Ehrhard, T. (2002). On Köthe sequence spaces and linear logic. Mathematical Structures in Computer Science 12 579–623.10.1017/S0960129502003729CrossRefGoogle Scholar
Ehrhard, T. (2005). Finiteness spaces. Mathematical Structures in Computer Science 15 (4) 615–646.10.1017/S0960129504004645CrossRefGoogle Scholar
Ehrhard, T. (2018). An introduction to differential linear logic: proof-nets, models and antiderivatives. Mathematical Structures in Computer Science 28 (7) 995–1060.10.1017/S0960129516000372CrossRefGoogle Scholar
Ehrhard, T. (2022). Differentials and distances in probabilistic coherence spaces. Logical Methods in Computer Science 18 (3).Google Scholar
Ehrhard, T. (2023a). A coherent differential PCF. Logical Methods in Computer Science 19 (4).Google Scholar
Ehrhard, T. (2023b). Coherent differentiation. Mathematical Structures in Computer Science 33 1–52.10.1017/S0960129523000129CrossRefGoogle Scholar
Ehrhard, T. and Regnier, L. (2003). The differential lambda-calculus. Theoretical Computer Science 309 (1-3) 1–41.10.1016/S0304-3975(03)00392-XCrossRefGoogle Scholar
Ehrhard, T. and Regnier, L. (2004). Differential interaction nets. In: Proceedings of WoLLIC’04, vol. 103 of Electronic Notes in Theoretical Computer Science, Elsevier Science, 35–74.Google Scholar
Ehrhard, T. and Regnier, L. (2006a). Böhm trees, Krivine machine and the Taylor expansion of ordinary lambda-terms. In: Beckmann, A., Berger, U., Löwe, B. and Tucker, J. V. (eds.) Logical Approaches to Computational Barriers, vol. 3988 of Lecture Notes in Computer Science, Springer-Verlag, 186–197.10.1007/11780342_20CrossRefGoogle Scholar
Ehrhard, T. and Regnier, L. (2006b). Differential interaction nets. Theoretical Computer Science 364 (2) 166–195.10.1016/j.tcs.2006.08.003CrossRefGoogle Scholar
Ehrhard, T. and Regnier, L. (2008). Uniformity and the Taylor expansion of ordinary lambda-terms. Theoretical Computer Science 403 (2-3) 347–372.10.1016/j.tcs.2008.06.001CrossRefGoogle Scholar
Ehrhard, T., Tasson, C. and Pagani, M. (2014). Probabilistic coherence spaces are fully abstract for probabilistic PCF. In: Jagannathan, S. and Sewell, P. (ed.) The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL ’14, San Diego, CA, USA, January 20-21, 2014, San Diego, CA, USA, ACM, 309–320.Google Scholar
Ehrhard, T. and Walch, A. (2023a). Cartesian coherent differential categories. In: LICS, IEEE, 1–13.10.1109/LICS56636.2023.10175717CrossRefGoogle Scholar
Ehrhard, T. and Walch, A. (2025). Coherent taylor expansion as a bimonad. Mathematical Structures in Computer Science 35. https://doi.org/10.1017/s0960129525000040 CrossRefGoogle Scholar
Girard, J.-Y. (1986). The system F of variable types, fifteen years later. Theoretical Computer Science 45 (2) 159–192.10.1016/0304-3975(86)90044-7CrossRefGoogle Scholar
Girard, J.-Y. (1987). Linear logic. Theoretical Computer Science 50 1–102.10.1016/0304-3975(87)90045-4CrossRefGoogle Scholar
Girard, J.-Y. (2004). Between logic and quantic: a tract. In: Ehrhard, T., Girard, J.-Y., Ruet, P. and Scott, P. (eds.) Linear Logic in Computer Science, vol. 316 of London Mathematical Society Lecture Notes Series, Cambridge University Press, 346–381.10.1017/CBO9780511550850.011CrossRefGoogle Scholar
Hines, P. (2013). A categorical analogue of the monoid semiring construction. Mathematical Structures in Computer Science 23 (1) 55–94.10.1017/S0960129512000059CrossRefGoogle Scholar
Kerjean, M. and Lemay, J.-S. P. (2023). Taylor expansion as a Monad in models of DiLL. In: LICS, IEEE, 1–13.10.1109/LICS56636.2023.10175753CrossRefGoogle Scholar
Kock, A. (2010). Synthetic Geometry of Manifolds, vol. 180 of Cambridge Tracts in Mathematics. Cambridge: Cambridge University Press.Google Scholar
Melliès, P.-A. (2009). Categorical semantics of linear logic. Panoramas et Synthèses 27 1–196.Google Scholar
Plotkin, G. D. (1977). LCF considered as a programming language. Theoretical Computer Science 5 (3) 223–255.10.1016/0304-3975(77)90044-5CrossRefGoogle Scholar
Blute, R. F., Cockett, J. R. B., Lemay, J.-S. P., Seely, R. A. G. (2020). Differential categories revisited. Applied Categorical Structures 28 (2) 171–235.10.1007/s10485-019-09572-yCrossRefGoogle Scholar
Rosický, J. (1984). Abstract tangent functors. Diagrammes 12 JR1–JR11.Google Scholar