Write a Blog >>
Tue 21 Jan 2020 16:05 - 16:35 at St Claude - D

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

Displayed time zone: Saskatchewan, Central America change

15:35 - 17:45
15:35
30m
Talk
Coinductive Trees for Exact Inference of Probabilistic Programs
LAFI
Alexander Bagnall Ohio University, Gordon Stewart Ohio University, Anindya Banerjee IMDEA Software Institute
16:05
30m
Talk
Name generation and Higher-order Probabilistic Programming (Or is new=rnd?)
LAFI
Dario Stein University of Oxford, Sam Staton University of Oxford, Michael Wolman McGill University
File Attached
16:35
30m
Talk
Density Functions of Statistical Probabilistic Programs
LAFI
Tom Mattinson University of Oxford, C.-H. Luke Ong University of Oxford
17:05
30m
Talk
Probabilistic Programming around Gaussian Processes
LAFI
17:35
10m
Day closing
Closing
LAFI