Probabilistic Programming Languages (PPLs) have a long history in both the functional (e.g., Anglican) and logic programming (e.g., ProbLog) paradigms. Unfortunately these efforts have been conducted mostly in isolation and little is known about the correspondences between the two approaches or their relative merits.… Read the rest
Monthly Archives: December 2016
In the theory of programming languages, the use of proof assistants has become mainstream. It is considered good form to provide a formal connection between a language and its semantics.
Currently, the main tools for this are based on either higher order logic, or on type theory.… Read the rest
We show how to decompose popular inference algorithms into a set of simple, reusable building blocks corresponding to monad transformers. We define a collection of such building blocks and implement them in Haskell producing a library for constructing inference algorithms in a modular fashion.… Read the rest
Welcome to PPS, workshop on probabilistic programming semantics, on Tuesday, 17 January 2017, colocated right before POPL. This informal workshop aims to bring programming-language and machine-learning researchers together to advance the semantic foundations of probabilistic programming.
We are delighted that Gordon Plotkin has accepted our invitation to give a talk “Towards a metric semantics for probabilistic programming“.… Read the rest