Write a Blog >>
PLDI 2020
Mon 15 - Fri 19 June 2020

We present $\lambda$PSI, the first probabilistic programming language and system that supports higher-order exact inference for probabilistic programs with first-class functions, nested inference and discrete, continuous and mixed random variables. $\lambda$PSI's solver is based on symbolic reasoning and computes the exact distribution represented by a program.

We show that $\lambda$PSI is practically effective—it automatically computes exact distributions for a number of interesting applications, from rational agents to information theory, many of which could so far only be handled approximately.

Fri 19 Jun
Times are displayed in time zone: Pacific Time (US & Canada) change

05:00 - 06:00: Probabilistic ProgrammingPLDI Research Papers at PLDI Research Papers live stream
Chair(s): Sasa MisailovicUniversity of Illinois at Urbana-Champaign

YouTube lightning session video

05:00 - 05:20
Talk
Proving Almost-Sure Termination by Omega-Regular Decomposition
PLDI Research Papers
Jianhui ChenTsinghua University, China, Fei HeTsinghua University, China
05:20 - 05:40
Talk
λPSI: Exact Inference for Higher-Order Probabilistic Programs
PLDI Research Papers
Timon GehrETH Zurich, Switzerland, Samuel SteffenETH Zurich, Switzerland, Martin VechevETH Zurich, Switzerland
05:40 - 06:00
Talk
Reactive Probabilistic Programming
PLDI Research Papers
Guillaume BaudartIBM Research, Louis MandelIBM Research, Eric AtkinsonMassachusetts Institute of Technology, USA, Benjamin ShermanMassachusetts Institute of Technology, USA, Marc PouzetÉcole normale supérieure, Michael CarbinMassachusetts Institute of Technology, USA
DOI Pre-print Media Attached