Upper approximating probabilities of convergence in probabilistic coherence spaces

08/11/2020
by   Thomas Ehrhard, et al.
0

We develop a theory of probabilistic coherence spaces equipped with an additional extensional structure and apply it to approximating probability of convergence of ground type programs of probabilistic PCF whose free variables are of ground types. To this end we define an adapted version of Krivine Machine which computes polynomial approximations of the semantics of these programs in the model. These polynomials provide approximations from below and from above of probabilities of convergence; this is made possible by extending the language with an error symbol which is extensionally maximal in the model.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/13/2020

On the linear structure of cones

For encompassing the limitations of probabilistic coherence spaces which...
research
05/26/2020

Differentials and distances in probabilistic coherence spaces (extended version)

In probabilistic coherence spaces, a denotational model of probabilistic...
research
02/28/2019

Semantics of higher-order probabilistic programs with conditioning

We present a denotational semantics for higher-order probabilistic progr...
research
01/22/2015

Output-Sensitive Adaptive Metropolis-Hastings for Probabilistic Programs

We introduce an adaptive output-sensitive Metropolis-Hastings algorithm ...
research
02/13/2019

Differentials and distances in probabilistic coherence spaces

In probabilistic coherence spaces, a denotational model of probabilistic...
research
05/01/2018

Probabilistic Stable Functions on Discrete Cones are Power Series (long version)

We study the category Cstabm of measurable cones and measurable stable f...
research
05/28/2018

Ranking and Repulsing Supermartingales for Approximating Reachability

Computing reachability probabilities is a fundamental problem in the ana...

Please sign up or login with your details

Forgot password? Click here to reset