Davide Barbarossa (TYPES)

Date: Tuesday, January 5 2027 – 13h00
Place: A008
Title: Program differentiation and logic

Automatic Differentiation consists in producing, via a static source code analysis, the code of a program computing the derivative of the function computed by a given program. For (idealised) functional languages, the approach introduced by Vákár and Smeding around 2020, called Combinatory Homomorphic AD (CHAD), shows the rich mathematical principles behind such a transformation.

On the other hand, there is another notion that we can well call “derivative” of an (idealised) functional program, apparently unrelated to Automatic Differentiation. That is due to the deep relationship between functional programming and logic and. More specifically, from the fact that we can differentiate a proof in the so-called differential linear logic, introduced by Ehrhard and Regnier around 2005.

In a still work in progress project with Michele Pagani and Paolo Pistone, from ENS-Lyon, we are showing that these two notions are actually very much related.

This seminar will be the occasion to discuss the ideas behind these notions of program differentiation.