ParhainHinta.fi
Semantics of the Probabilistic Typed Lambda Calculus

Springer

Semantics of the Probabilistic Typed Lambda Calculus

Alin havaittu hinta

100,00 €
1 kauppa

Hinnat kaupoissa

1 tarjous
Finlandia Kirja
Havaittu
100,00 €
Siirry kauppaan

Hinnat ovat viimeksi havaittuja. Tarkista ajantasainen hinta, saatavuus ja toimituskulut kaupasta.

Hintahistoria

5 hintahavaintoa

Kaavio näyttää kunkin havaintopäivän alimman tallennetun tuotehinnan. Havaintojen välistä hintaa ei ole vahvistettu.

Alin havaittu
96,29 €
Korkein havaittu
100,00 €
Viimeisin historian havainto
Hintahistoria: 2 havaintopäivää96,29 €100,00 €21.9.2026: 96,29 €29.10.2026: 100,00 €21.9.202629.10.2026
Näytä kaikki 5 hintahavaintoa
Hinta havaittu (Suomen aika)Hinta
96,29 €
100,00 €
96,29 €
100,00 €
100,00 €

Tuotetiedot

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.

Brändi
Springer
EAN / GTIN
9783642551987