ESOP 2015
Tue 14 - Thu 16 April 2015 London, United Kingdom
Tue 14 Apr 2015 11:30 - 12:00 at Skeel - Session 1 Chair(s): Jan Vitek

Many probabilistic programming languages allow programs to be run under constraints in order to carry out Bayesian inference. Running programs under constraints could enable other uses such as rare event simulation and probabilistic verification, except that all such probabilistic languages are necessarily limited because they are defined or implemented in terms of an impoverished theory of probability. Measure-theoretic probability provides a more general foundation, but its generality makes finding computational content difficult. We develop a measure-theoretic semantics for a first-order probabilistic language with recursion, which interprets programs as functions that compute preimages. Preimage functions are generally uncomputable, so we derive an approximating semantics. We implement the approximating semantics and use the implementation to carry out Bayesian inference, stochastic ray tracing, and probabilistic verification of floating-point error bounds.

Tue 14 Apr

10:30 - 12:30: ESOP - Session 1 at Skeel
Chair(s): Jan VitekNortheastern University
esop-2015-papers142900020000010:30 - 11:00
Andrew D. GordonMicrosoft Research and University of Edinburgh, Claudio RussoMicrosoft Research, Marcin SzymczakUniversity of Edinburgh, Johannes BorgströmUppsala University, Nicolas RollandMicrosoft Research, Thore GraepelMicrosoft Research, Daniel TarlowMicrosoft Research
esop-2015-papers142900200000011:00 - 11:30
Tie ChengCNRS, ENS, INRIA, Paris, France, Xavier RivalINRIA/CNRS/ENS Paris
esop-2015-papers142900380000011:30 - 12:00
Neil TorontoBrigham Young University, Jay McCarthy, David Van Horn
esop-2015-papers142900560000012:00 - 12:30
Manuel EberlTechnische Universität München, Johannes HölzlTechnische Universität München, Tobias NipkowTechnische Universität München