Abstract: The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as far as the differential lambda-calculus and differential linear logic are concerned, these models feature finite non-determinism and indeed these languages are essentially non-deterministic. In a previous paper we introduced a categorical framework for differentiation which does not require additivity and is compatible with deterministic models such as coherence spaces and probabilistic models such as probabilistic coherence spaces. Based on this semantics we develop a syntax of a deterministic version of the differential lambda-calculus. One nice feature of this new approach to differentiation is that it is compatible with general fixpoints of terms, so our language is actually a differential extension of PCF for which we provide a fully deterministic operational semantics.
Cites work
- Acyclic solos and differential interaction nets
- Call-by-push-value: Decomposing call-by-value and call-by-name
- Cartesian differential categories
- Categorical semantics of linear logic
- Coherent differentiation
- Differential structure, tangent structure, and SDG
- Differentials and distances in probabilistic coherence spaces
- Full abstraction for probabilistic PCF
- Interpreting a Finitary Pi-calculus in Differential Interaction Nets
- LCF considered as a programming language
- Partial monoids: associativity and confluence.
- Probabilistic call by push value
- Probabilistic coherence spaces as a model of higher-order probabilistic computation
- The differential lambda-calculus
- The free exponential modality of probabilistic coherence spaces
Cited in
(4)
This page was built for publication: A coherent differential PCF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178673)
