A coherent differential PCF

DOI10.46298/LMCS-19(4:7)2023MaRDI QIDQ6178673zbMATH OpenOpenAlexFDO

Authors Thomas Ehrhard

Publication date 16 January 2024

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2205.04109

zbMATH Keywords

proof theorycategory theorylinear logic\(\lambda\)-calculusfunctional programming languagesdifferential \(\lambda\)-calculus

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

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

• scientific article; zbMATH DE number 7559283 (Why is no real title available?)
• 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
• 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

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)