48 citations · 48 across the 2 of their papers we have counts for
3 papers
cs.LO2020★ 48 cited
Automatic Differentiation in PCF
Damiano Mazza, Michele Pagani
We study the correctness of automatic differentiation (AD) in the context of a higher-order, Turing-complete language (PCF with real numbers), both in forward and reverse mode. Our…
cs.LO2019
Backpropagation in the Simply Typed Lambda-calculus with Linear Negation
Alois Brunel, Damiano Mazza, Michele Pagani
Backpropagation is a classic automatic differentiation algorithm computing the gradient of functions specified by a certain class of simple, first-order programs, called computatio…
cs.CC2012
Computational Complexity of Interactive Behaviors
Ugo Dal Lago, Tobias Heindel, Damiano Mazza +1
The theory of computational complexity focuses on functions and, hence, studies programs whose interactive behavior is reduced to a simple question/answer pattern. We propose a bro…