bokomslag Semantics of the Probabilistic Typed Lambda Calculus
Data & IT

Semantics of the Probabilistic Typed Lambda Calculus

Dirk Draheim

Pocket

1799:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 7-12 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

Andra format:

  • 218 sidor
  • 2018
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.
  • Författare: Dirk Draheim
  • Format: Pocket/Paperback
  • ISBN: 9783662568729
  • Språk: Engelska
  • Antal sidor: 218
  • Utgivningsdatum: 2018-05-04
  • Förlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. K