Name generation and Higher-order Probabilistic Programming (Or is new=rnd?)
We illustrate the close connections between name generation and probabilistic programming. By interpreting name generation as random sampling, we obtain a new denotational semantics for name generation. Using a novel analysis of distributions on function spaces, we can show that this semantics is actually very fine-grained.
Tue 21 Jan Times are displayed in time zone: Saskatchewan, Central America change
15:35 - 17:45
|Coinductive Trees for Exact Inference of Probabilistic Programs|
|Name generation and Higher-order Probabilistic Programming (Or is new=rnd?)|
|Density Functions of Statistical Probabilistic Programs|
|Probabilistic Programming around Gaussian Processes|