DeepAI
Log In Sign Up

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

04/13/2021
by   Guillaume Geoffroy, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/28/2019

Semantics of higher-order probabilistic programs with conditioning

We present a denotational semantics for higher-order probabilistic progr...
03/27/2013

Do We Need Higher-Order Probabilities and, If So, What Do They Mean?

The apparent failure of individual probabilistic expressions to distingu...
12/15/2015

Linear Models of Computation and Program Learning

We consider two classes of computations which admit taking linear combin...
07/25/2019

Learning higher-order logic programs

A key feature of inductive logic programming (ILP) is its ability to lea...
07/13/2020

Generating Functions for Probabilistic Programs

This paper investigates the usage of generating functions (GFs) encoding...
10/22/2020

Translating Recursive Probabilistic Programs to Factor Graph Grammars

It is natural for probabilistic programs to use conditionals to express ...
01/31/2022

A Sampling-Aware Interpretation of Linear Logic: Syntax and Categorical Semantics

The usual resource interpretation of linear logic says that variables ha...