An Application of Computable Distributions to the Semantics of Probabilistic Programs

06/20/2018
by   Daniel Huang, et al.
0

In this chapter, we explore how (Type-2) computable distributions can be used to give both distributional and (algorithmic) sampling semantics to probabilistic programs with continuous distributions. Towards this end, we first sketch an encoding of computable distributions in a fragment of Haskell. Next, we show how topological domains can be used to model the resulting PCF-like language. Throughout, we hope to emphasize the connection of such an approach with ordinary programming.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/18/2020

Weakest Preexpectation Semantics for Bayesian Inference

We present a semantics of a probabilistic while-language with soft condi...
research
07/19/2023

Symbolic Semantics for Probabilistic Programs (extended version)

We present a new symbolic execution semantics of probabilistic programs ...
research
03/30/2021

Expected-Cost Analysis for Probabilistic Programs and Semantics-Level Adaption of Optional Stopping Theorems

In this article, we present a semantics-level adaption of the Optional S...
research
09/17/2021

Syntactic Requirements for Well-defined Hybrid Probabilistic Logic Programs

Hybrid probabilistic logic programs can represent several scenarios than...
research
11/12/2022

The generalised distribution semantics and projective families of distributions

We generalise the distribution semantics underpinning probabilistic logi...
research
12/06/2009

Computable de Finetti measures

We prove a computable version of de Finetti's theorem on exchangeable se...
research
07/13/2020

Generating Functions for Probabilistic Programs

This paper investigates the usage of generating functions (GFs) encoding...

Please sign up or login with your details

Forgot password? Click here to reset