0
Your Cart
0
Your Cart

This book takes a foundational approach to the semantics of probabilistic programming. It elaborates a rigorous Markov chain semantics for the probabilistic typed lambda calculus, which is the typed lambda calculus with recursion plus probabilistic choice.

The book starts with a recapitulation of the basic mathematical tools needed throughout the book, in particular Markov chains, graph theory and domain theory, and also explores the topic of inductive definitions. It then defines the syntax and establishes the Markov chain semantics of the probabilistic lambda calculus and, furthermore, both a graph and a tree semantics. Based on that, it investigates the termination behavior of probabilistic programs. It introduces the notions of termination degree, bounded termination and path stoppability and investigates their mutual relationships. Lastly, it defines a denotational semantics of the probabilistic lambda calculus, based on continuous functions over probability distributionsas domains.

The work mostly appeals to researchers in theoretical computer science focusing on probabilistic programming, randomized algorithms, or programming language theory.

New item(s) have been added to your cart.

Quantity: 1
Total: $19.99

Frequently bought with Semantics of the Probabilistic Typed Lambda Calculus: Markov Chain Semantics, Termination Behavior, and Denotational Semantics

View more
Multiple View Geometry in Computer Vision Original price was: $59.99.Current price is: $19.99.
View more
View more
Proof Complexity Original price was: $179.99.Current price is: $19.99.
View more
Math Matters: Understanding the Math You Teach, Grades K–8 Original price was: $49.99.Current price is: $19.99.
View more
Geometry For Dummies Original price was: $19.99.Current price is: $14.99.
View more
Linear Algebra (Dover Books on Mathematics) Original price was: $19.99.Current price is: $14.99.
View more
Visual Complex Analysis: 25th Anniversary Edition Original price was: $79.99.Current price is: $29.99.
View more