Probabilistic programming languages (PPLs) allow programmers to construct statistical models and then simulate data or perform inference over them. Many PPLs restrict models to a particular instance of simulation or inference, limiting their reusability. In other PPLs, models are not readily composable. Using Haskell as the host language, we present an embedded domain specific language based on algebraic effects, where probabilistic models are modular, first-class, and reusable for both simulation and inference. We also demonstrate how simulation and inference can be expressed naturally as composable program transformations using algebraic effect handlers.
Wed 14 SepDisplayed time zone: Belgrade, Bratislava, Budapest, Ljubljana, Prague change
Wed 14 Sep
Displayed time zone: Belgrade, Bratislava, Budapest, Ljubljana, Prague change
15:50 - 16:50 | Effects and Type InferenceICFP Papers and Events at Linhart Chair(s): Ben Lippmeier Ghost Locomotion | ||
15:50 20mTalk | Modular Probabilistic Models via Algebraic Effects ICFP Papers and Events Minh Nguyen University of Bristol, Roly Perera Alan Turing Institute, Meng Wang University of Bristol, Nicolas Wu Imperial College London DOI | ||
16:10 20mTalk | Constraint-based type inference for FreezeML ICFP Papers and Events Frank Emrich University of Edinburgh, UK, Jan Stolarek University of Edinburgh, UK, James Cheney University of Edinburgh; Alan Turing Institute, Sam Lindley The University of Edinburgh, UK DOI | ||
16:30 20mTalk | Linearly Qualified Types: Generic inference for capabilities and uniqueness ICFP Papers and Events Arnaud Spiwack Tweag, Csongor Kiss Imperial College London, Jean-Philippe Bernardy University of Gothenburg, Sweden, Nicolas Wu Imperial College London, Richard A. Eisenberg Jane Street Link to publication DOI Pre-print |