Verlag: Springer Berlin Heidelberg, Springer Berlin Heidelberg Mai 2018, 2018
ISBN 10: 3662568721 ISBN 13: 9783662568729
Sprache: Englisch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
EUR 128,39
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbTaschenbuch. Zustand: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 228 pp. Englisch.
Verlag: Springer Berlin Heidelberg, Springer Berlin Heidelberg Mär 2017, 2017
ISBN 10: 3642551971 ISBN 13: 9783642551970
Sprache: Englisch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
EUR 128,39
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbBuch. Zustand: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 228 pp. Englisch.
Verlag: Springer Berlin Heidelberg, 2018
ISBN 10: 3662568721 ISBN 13: 9783662568729
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
EUR 128,39
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbTaschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
Verlag: Springer Berlin Heidelberg, 2017
ISBN 10: 3642551971 ISBN 13: 9783642551970
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
EUR 128,39
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbBuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 139,59
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 139,59
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: Books Puddle, New York, NY, USA
EUR 156,16
Währung umrechnenAnzahl: 4 verfügbar
In den WarenkorbZustand: New.
Anbieter: Lucky's Textbooks, Dallas, TX, USA
EUR 119,91
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: Lucky's Textbooks, Dallas, TX, USA
EUR 120,24
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 176,78
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 228 pages. 9.25x6.10x0.51 inches. In Stock.
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
EUR 175,64
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbHardcover. Zustand: New. New. book.
Verlag: Springer Berlin Heidelberg, 2018
ISBN 10: 3662568721 ISBN 13: 9783662568729
Sprache: Englisch
Anbieter: moluna, Greven, Deutschland
EUR 109,83
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Provides an in-depth discussion of the semantics of the probabilistic typed lambda calculus and its termination behaviorSelf-contained, offering a recapitulation of the basic mathematical tools neededIncludes an extensive list of further re.
Verlag: Springer Berlin Heidelberg Mai 2018, 2018
ISBN 10: 3662568721 ISBN 13: 9783662568729
Sprache: Englisch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
EUR 128,39
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbTaschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 228 pp. Englisch.
Verlag: Springer Berlin Heidelberg Mrz 2017, 2017
ISBN 10: 3642551971 ISBN 13: 9783642551970
Sprache: Englisch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
EUR 128,39
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbBuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 228 pp. Englisch.
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 164,52
Währung umrechnenAnzahl: 4 verfügbar
In den WarenkorbZustand: New. Print on Demand.
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
EUR 169,75
Währung umrechnenAnzahl: 4 verfügbar
In den WarenkorbZustand: New. PRINT ON DEMAND.