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

We propose a coinductive variant of Knuth-Yao trees (variously, Discrete Distribution Generating trees) as an intermediate representation supporting exact inference for probabilistic programs which may contain loops with probabilistic termination conditions. We provide a prototype implementation of a probabilistic programming language, Zar, written in Haskell, exemplifying both Knuth-Yao trees as well as exact inference on the trees.

Tue 21 Jan
Times are displayed in time zone: (GMT-06:00) Saskatchewan, Central America change

lafi-2020
15:35 - 17:45: LAFI (né PPS) - D at St Claude
lafi-202015:35 - 16:05
Talk
Alexander BagnallOhio University, Gordon StewartOhio University, Anindya BanerjeeIMDEA Software Institute
lafi-202016:05 - 16:35
Talk
Dario SteinUniversity of Oxford, Sam StatonUniversity of Oxford, Michael WolmanMcGill University
File Attached
lafi-202016:35 - 17:05
Talk
Tom MattinsonUniversity of Oxford, C.-H. Luke OngUniversity of Oxford
lafi-202017:05 - 17:35
Talk
lafi-202017:35 - 17:45
Day closing