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 (GMT-06:00) Saskatchewan, Central America change
|15:35 - 16:05|
|16:05 - 16:35|
|16:35 - 17:05|
|17:05 - 17:35|
|17:35 - 17:45|