Equations on programs are used to express domain knowledge, verify correctness, and improve performance, by people such as programmers and by tools such as compilers. It turns out that equations on probabilistic programs are a particularly good way to express Bayesian inference, verify distribution correctness, and improve sampler performance. In this way, this tutorial will introduce the mathematical reasoning principles that practitioners of probabilistic reasoning use to turn declarative models into efficient algorithms. These principles include integration and conjugacy, density and conditioning, and detailed balance.

Mon 8 Jan

POPL-2018-TutorialFest
09:00 - 10:30: TutorialFest - Equational reasoning for probabilistic programming at Bradbury
POPL-2018-TutorialFest151539840000009:00 - 10:30
Talk
Chung-chieh ShanIndiana University, USA
Media Attached
POPL-2018-TutorialFest
11:00 - 12:00: TutorialFest - Equational reasoning for probabilistic programming at Bradbury
POPL-2018-TutorialFest151540560000011:00 - 12:00
Talk
Chung-chieh ShanIndiana University, USA
Media Attached