International audienceWe study the deep relations existing between differential logical relations and incremental computing, by showing how self-differences in the former precisely correspond to derivatives in the latter. We also show how differential logical relations can be seen as a powerful metatheoretical tool in the analysis of incremental computations, enabling an easy proof of soundness of differentiation
In mathematics and computer algebra, automatic differentiation (AD) is a set of techniques to evalua...
International audienceWe define a differential lambda-mu-calculus which is an extension of both Pari...
Differential-difference operators are linear operators involving both d/dz and the shift z ↦ z + 1 (...
We study the deep relation existing between differential logical relations and incremental computing...
International audienceWe introduce a new form of logical relation which, in the spirit of metric rel...
We introduce a new form of logical relation which, in the spirit of metric relations, allows us to a...
International audienceSemantics is traditionally concerned with program equivalence, in which all pa...
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...
Formal transformations somehow resembling the usual derivative are surprisingly common in computer s...
We present a simple technique for semantic, open logical relations arguments about languages with re...
Abstract. Differential dataflow is a recent approach to incremental computation that relies on a par...
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...
The context of this work is Automatic Differentiation (AD). Fundamentally, AD transforms a program t...
In mathematics and computer algebra, automatic differentiation (AD) is a set of techniques to evalua...
International audienceWe define a differential lambda-mu-calculus which is an extension of both Pari...
Differential-difference operators are linear operators involving both d/dz and the shift z ↦ z + 1 (...
We study the deep relation existing between differential logical relations and incremental computing...
International audienceWe introduce a new form of logical relation which, in the spirit of metric rel...
We introduce a new form of logical relation which, in the spirit of metric relations, allows us to a...
International audienceSemantics is traditionally concerned with program equivalence, in which all pa...
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...
Formal transformations somehow resembling the usual derivative are surprisingly common in computer s...
We present a simple technique for semantic, open logical relations arguments about languages with re...
Abstract. Differential dataflow is a recent approach to incremental computation that relies on a par...
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...
The context of this work is Automatic Differentiation (AD). Fundamentally, AD transforms a program t...
In mathematics and computer algebra, automatic differentiation (AD) is a set of techniques to evalua...
International audienceWe define a differential lambda-mu-calculus which is an extension of both Pari...
Differential-difference operators are linear operators involving both d/dz and the shift z ↦ z + 1 (...