Logo

The Design and Implementation of Probabilistic Programming Languages

Small book cover: The Design and Implementation of Probabilistic Programming Languages

The Design and Implementation of Probabilistic Programming Languages
by

Publisher: dippl.org
Number of pages: 215

Description:
This book explains how to implement PPLs by lightweight embedding into a host language. We illustrate this by designing and implementing WebPPL, a small PPL embedded in Javascript. We show how to implement several algorithms for universal probabilistic inference, including priority-based enumeration with caching, particle filtering, and Markov chain Monte Carlo.

Home page url

Download or read it online for free here:
Read online
(online html)

Similar books

Book cover: Programming Languages: Theory and PracticeProgramming Languages: Theory and Practice
by - Carnegie Mellon University
What follows is a working draft of a planned book that seeks to strike a careful balance between developing the theoretical foundations of programming languages and explaining the pragmatic issues involved in their design and implementation.
(11502 views)
Book cover: Implementing Functional Languages: a tutorialImplementing Functional Languages: a tutorial
by - Prentice Hall
This book gives a practical approach to understanding implementations of non-strict functional languages using lazy graph reduction. It is intended to be a source of practical material, to help make functional-language implementations come alive.
(13362 views)
Book cover: Proofs and TypesProofs and Types
by - Cambridge University Press
This little book comes from a short graduate course on typed lambda-calculus given at the Universite Paris. It is not intended to be encyclopedic and the selection of topics was really quite haphazard. Some very basic knowledge of logic is needed.
(18073 views)
Book cover: Concrete Semantics: With Isabelle/HOLConcrete Semantics: With Isabelle/HOL
by - Springer
The book teaches the reader the art of precise logical reasoning and the practical use of a proof assistant as a tool for formal proofs about computer science artefacts. All the mathematics is formalised in Isabelle and much of it is executable.
(6650 views)