We study the deep relation existing between differential logical relations and incremental computing by showing how self-differences in the former precisely correspond to derivatives in the latter. The byproduct of such a relationship is twofold: on the one hand, we show how differential logical relations can be seen as a powerful meta-theoretical tool in the analysis of incremental computations, enabling an easy proof of soundness of differentiation. On the other hand, we generalize differential logical relations so as to be able to interpret full recursion, something not possible in the original system
Differentiation arithmetic is a principal and accurate technique for the computational evaluation of...
The context of this work is Automatic Differentiation (AD). Fundamentally, AD transforms a program t...
The critical analysis of the foundations of the differential calculus is proposed. Methodological ba...
We study the deep relation existing between differential logical relations and incremental computing...
We introduce a new form of logical relation which, in the spirit of metric relations, allows us to a...
International audienceWe introduce a new form of logical relation which, in the spirit of metric rel...
Semantics is traditionally concerned with program equivalence, in which all pairs of programs which ...
We present semantic correctness proofs of automatic differentiation (AD). We consider a forward-mode...
We present semantic correctness proofs of Automatic Differentiation (AD). We consider a forward-mode...
We present a simple technique for semantic, open logical relations arguments about languages with re...
Formal transformations somehow resembling the usual derivative are surprisingly common in computer s...
Logical relations are one among the most powerful techniques in the theory of programming languages,...
We present semantic correctness proofs of automatic differentiation (AD). We consider a forward-mode...
Incremental computation has recently been studied using the concepts of change structures and deriva...
Abstract. Differential dataflow is a recent approach to incremental computation that relies on a par...
Differentiation arithmetic is a principal and accurate technique for the computational evaluation of...
The context of this work is Automatic Differentiation (AD). Fundamentally, AD transforms a program t...
The critical analysis of the foundations of the differential calculus is proposed. Methodological ba...
We study the deep relation existing between differential logical relations and incremental computing...
We introduce a new form of logical relation which, in the spirit of metric relations, allows us to a...
International audienceWe introduce a new form of logical relation which, in the spirit of metric rel...
Semantics is traditionally concerned with program equivalence, in which all pairs of programs which ...
We present semantic correctness proofs of automatic differentiation (AD). We consider a forward-mode...
We present semantic correctness proofs of Automatic Differentiation (AD). We consider a forward-mode...
We present a simple technique for semantic, open logical relations arguments about languages with re...
Formal transformations somehow resembling the usual derivative are surprisingly common in computer s...
Logical relations are one among the most powerful techniques in the theory of programming languages,...
We present semantic correctness proofs of automatic differentiation (AD). We consider a forward-mode...
Incremental computation has recently been studied using the concepts of change structures and deriva...
Abstract. Differential dataflow is a recent approach to incremental computation that relies on a par...
Differentiation arithmetic is a principal and accurate technique for the computational evaluation of...
The context of this work is Automatic Differentiation (AD). Fundamentally, AD transforms a program t...
The critical analysis of the foundations of the differential calculus is proposed. Methodological ba...