Free shipping on all orders over $79* Limited Time Only
Track My Order
Help Centre
Likes
My Wish ListsLogin / Join
Booktopia
Australia's local bookstore
Get Free Shipping on orders over $79
Semantics of the Probabilistic Typed Lambda Calculus : Markov Chain Semantics, Termination Behavior, and Denotational Semantics - Dirk Draheim

Semantics of the Probabilistic Typed Lambda Calculus

Markov Chain Semantics, Termination Behavior, and Denotational Semantics

By: Dirk Draheim

eText | 28 February 2017

At a Glance

eText

$189.00

or 4 interest-free payments of $47.25 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.
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 distributions as domains. The work mostly appeals to researchers in theoretical computer science focusing on probabilistic programming, randomized algorithms, or programming language theory.
on
Desktop
Tablet
Mobile

You Can Find This eBook In

Non-FictionComputing & I.T.Computer ScienceComputer Programming & Software DevelopmentProgramming & Scripting LanguagesBusiness ApplicationsMathematical & Statistical SoftwareCompilers & InterpretersMathematicsProbability & Statistics

Other Editions and Formats

Paperback

Published: 4th May 2018

View Product

More in Computer Science

Amazon.com : Get Big Fast - Robert Spector

eBOOK

Amazon.com

Get Big Fast

eBook

$22.99

ReFormat : Windows 11 - Adam Natad

eBOOK

ReFormat

Windows 11

eBook

$8.43

AI-Powered Search - Trey Grainger

eBOOK

AI-Powered Search

eBook

$52.99

This product is categorised by