Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Extensional Denotational Semantics of Higher-Order Probabilistic Programs, Beyond the Discrete Case

Guillaume Geoffroy 1, 2
2 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
Abstract : We describe a mathematical structure that can give extensional denotational semantics to higher-order probabilistic programs. It is not limited to discrete probabilities, and it is compatible with integration in a way the models that have been proposed before are not. It is organised as a model of propositional linear logic in which all the connectives have intuitive probabilistic interpretations. In addition, it has least fixed points for all maps, so it can interpret recursion.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03187624
Contributor : Guillaume Geoffroy <>
Submitted on : Tuesday, April 6, 2021 - 5:31:47 PM
Last modification on : Wednesday, April 14, 2021 - 3:31:33 AM

Files

geoffroy-21-convex-qbs.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03187624, version 1

Citation

Guillaume Geoffroy. Extensional Denotational Semantics of Higher-Order Probabilistic Programs, Beyond the Discrete Case. 2021. ⟨hal-03187624v1⟩

Share

Metrics

Record views

12

Files downloads

1