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: Structure and Interpretation of Computer ProgramsStructure and Interpretation of Computer Programs
by - McGraw-Hill
The book teaches how to program by employing the tools of abstraction and modularity. The central philosophy is that programming is the task of breaking large problems into small ones. You will learn how to program and how to think about programming.
(19005 views)
Book cover: Semantics: Advances in Theories and Mathematical ModelsSemantics: Advances in Theories and Mathematical Models
by - InTech
The book is a blend of a number of great ideas, theories, mathematical models, and practical systems in the domain of Semantics. Topics include: Background; Queries, Predicates, and Semantic Cache; Algorithms and Logic Programming; etc.
(10329 views)
Book cover: Lecture Notes on the Lambda CalculusLecture Notes on the Lambda Calculus
by - Dalhousie University
Topics covered in these notes include the untyped lambda calculus, the Church-Rosser theorem, combinatory algebras, the simply-typed lambda calculus, the Curry-Howard isomorphism, weak and strong normalization, type inference, etc.
(12788 views)
Book cover: Lectures on the Curry-Howard IsomorphismLectures on the Curry-Howard Isomorphism
by - Elsevier Science
This book give an introduction to parts of proof theory and related aspects of type theory relevant for the Curry-Howard isomorphism. It can serve as an introduction to any or both of typed lambda-calculus and intuitionistic logic.
(12272 views)