Semantics of higher-order probabilistic programs with conditioning

02/28/2019
by   Fredrik Dahlqvist, et al.
0

We present a denotational semantics for higher-order probabilistic programs in terms of linear operators between Banach spaces. Our semantics is rooted in the classical theory of Banach spaces and their tensor products, but bears similarities with the well-known Scott semantics of higher-order programs through the use ordered Banach spaces which allow definitions in terms of fixed points. Being based on a monoidal rather than cartesian closed structure, our semantics effectively treats randomness as a resource.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/13/2021

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

We describe a mathematical structure that can give extensional denotatio...
research
04/27/2021

On Generalized Metric Spaces for the Simply Typed Lambda-Calculus (Extended Version)

Generalized metrics, arising from Lawvere's view of metric spaces as enr...
research
06/27/2023

Oscillations and differences in Triebel-Lizorkin-Morrey spaces

In this paper we are concerned with Triebel-Lizorkin-Morrey spaces ℰ^s_u...
research
07/16/2018

Formal verification of higher-order probabilistic programs

Probabilistic programming provides a convenient lingua franca for writin...
research
08/26/2017

The Unfolding Semantics of Functional Programs

The idea of using unfolding as a way of computing a program semantics ha...
research
12/15/2015

Linear Models of Computation and Program Learning

We consider two classes of computations which admit taking linear combin...
research
08/11/2020

Upper approximating probabilities of convergence in probabilistic coherence spaces

We develop a theory of probabilistic coherence spaces equipped with an a...

Please sign up or login with your details

Forgot password? Click here to reset