This book provides an overview of the theoretical underpinnings of modern probabilistic programming and presents applications in e.g., machine learning, security, and approximate computing. Comprehensive survey chapters make the material accessible to graduate students and non-experts. This title is also available as Open Access on Cambridge Core.

What does a probabilistic program actually compute? How can one formally reason about such probabilistic programs? This valuable guide covers such elementary questions and more. It provides a state-of-the-art overview of the theoretical underpinnings of modern probabilistic programming and their applications in machine learning, security, and other domains, at a level suitable for graduate students and non-experts in the field. In addition, the book treats the connection between probabilistic programs and mathematical logic, security (what is the probability that software leaks confidential information?), and presents three programming languages for different applications: Excel tables, program testing, and approximate computing. This title is also available as Open Access on Cambridge Core.

'In our data-rich world, probabilistic programming is what allows programmers to perform statistical inference in a principled way for use in automated decision making. This rapidly growing field, which has emerged at the intersection of machine learning, statistics and programming languages, has the potential to become the driving force behind AI. But probabilistic programs can be counterintuitive and difficult to understand. This edited volume gives a comprehensive overview of the foundations of probabilistic programming, clearly elucidating the basic principles of how to design and reason about probabilistic programs, while at the same time highlighting pertinent applications and existing languages. With its breadth of topic coverage, the book will serve as an important and timely reference for researchers and practitioners.' Marta Kwiatkowska, University of Oxford