Articles liés à Semantics of the Probabilistic Typed Lambda Calculus:...
Semantics of the Probabilistic Typed Lambda Calculus: Markov Chain Semantics, Termination Behavior, and Denotational Semantics - Couverture rigide
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
À propos de l?auteur
Dirk Draheim is full professor of information society technologies and head of the large-scale systems group at Tallinn University of Technology. From to 1990 to 2006 he worked as an IT project manager, IT consultant and IT author in Berlin. In summer 2006, he was Lecturer at the University of Auckland and from 2006-2008 he was area manager for database systems at the Software Competence Center Hagenberg as well as Adjunct Lecturer in information systems at the Johannes-Kepler-University Linz. From 2008 to 2016 he was head of the data center of the University of Innsbruck and, in parallel, from 2010 to 2016, Adjunct Reader at the Faculty of Information Systems of the University of Mannheim. Dirk is co-author of the Springer book "Form-Oriented Analysis" and author of the Springer book "Business Process Technology", and a member of the ACM.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 109,83
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Semantics of the Probabilistic Typed Lambda Calculus:...
Image fournie par le vendeur
Semantics of Probabilistic Computation and Logics
Edité par
Springer Berlin Heidelberg, 2017
ISBN 10 : 3642551971
ISBN 13 : 9783642551970
Neuf
Couverture rigide
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Gebunden. Etat : 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. N° de réf. du vendeur 35616798
Quantité disponible : Plus de 20 disponibles
Image d'archives
Semantics of the Probabilistic Typed Lambda Calculus: Markov Chain Semantics, Termination Behavior, and Denotational Semantics
Vendeur : Best Price, Torrance, CA, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. SUPER FAST SHIPPING. N° de réf. du vendeur 9783642551970
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Semantics of the Probabilistic Typed Lambda Calculus : Markov Chain Semantics, Termination Behavior, and Denotational Semantics
Edité par
Springer Berlin Heidelberg, 2017
ISBN 10 : 3642551971
ISBN 13 : 9783642551970
Neuf
Couverture rigide
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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. N° de réf. du vendeur 9783642551970
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Semantics of the Probabilistic Typed Lambda Calculus
Edité par
Springer Berlin Heidelberg Mrz 2017, 2017
ISBN 10 : 3642551971
ISBN 13 : 9783642551970
Neuf
Couverture rigide
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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. N° de réf. du vendeur 9783642551970
Quantité disponible : 2 disponible(s)
Image d'archives
Semantics of the Probabilistic Typed Lambda Calculus: Markov Chain Semantics, Termination Behavior, and Denotational Semantics
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783642551970_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Semantics of the Probabilistic Typed La (eng)
impression à la demandeVendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Évaluation du vendeur 5 sur 5 étoiles
Etat : new. Questo è un articolo print on demand. N° de réf. du vendeur d888e8801d98561885f68abde1cd47ce
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Semantics of the Probabilistic Typed Lambda Calculus
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Mär 2017, 2017
ISBN 10 : 3642551971
ISBN 13 : 9783642551970
Neuf
Couverture rigide
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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. N° de réf. du vendeur 9783642551970
Quantité disponible : 2 disponible(s)
Image d'archives
Semantics of Probabilistic Computation and Logics: Probabilistic Lambda Calculi, Markov Chains, Domain Theory and Probabilistic Reasoning Systems
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 211. N° de réf. du vendeur 26372461019
Quantité disponible : 4 disponible(s)
Image d'archives
Semantics of the Probabilistic Typed Lambda Calculus: Markov Chain Semantics, Termination Behavior, and Denotational Semantics
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020230964
Quantité disponible : Plus de 20 disponibles
Image d'archives
Semantics of Probabilistic Computation and Logics: Probabilistic Lambda Calculi, Markov Chains, Domain Theory and Probabilistic Reasoning Systems
impression à la demandeVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Print on Demand pp. 211. N° de réf. du vendeur 373617156
Quantité disponible : 4 disponible(s)