東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁 到查詢結果 [ subject:"Lambda calculus." ]

切換: 標籤 | MARC模式 | ISBD

Semantics of the probabilistic typed...

Draheim, Dirk.

FindBook

Google Book

Amazon

博客來

Semantics of the probabilistic typed lambda calculus = Markov chain semantics, termination behavior, and denotational semantics /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Semantics of the probabilistic typed lambda calculus/ by Dirk Draheim.
其他題名:	Markov chain semantics, termination behavior, and denotational semantics /
作者:	Draheim, Dirk.
出版者:	Berlin, Heidelberg :Springer Berlin Heidelberg : : 2017.,
面頁冊數:	viii, 218 p. :ill., digital ;24 cm.
內容註:	Part I: The Probabilistic Lambda-Calculus and its Semantics -- Introduction -- Syntax and Operational Semantics -- The Working Probabilistic Lambda Calculus -- Properties of the Markov Chain Semantics -- Denotational Semantics -- Semantical Correspondences -- Categorical Treatment -- Probabilism and Non-Determinism -- Part II: Natural Probabilistic Reasoning -- On Natural Two-Tier Semantics for Propositional Logics -- Natural Semantics of Propositions -- Finite Discrete Stochastics Reconsidered -- Lambda-Calculus Definitions -- Markov Chains -- Basic Logic Language and Semantics Definitions -- References -- Index.
Contained By:	Springer eBooks
標題:	Lambda calculus. -
電子資源:	http://dx.doi.org/10.1007/978-3-642-55198-7
ISBN:	9783642551987

Semantics of the probabilistic typed lambda calculus = Markov chain semantics, termination behavior, and denotational semantics /
Draheim, Dirk.

Semantics of the probabilistic typed lambda calculusMarkov chain semantics, termination behavior, and denotational semantics /[electronic resource] :by Dirk Draheim. - Berlin, Heidelberg :Springer Berlin Heidelberg :2017. - viii, 218 p. :ill., digital ;24 cm.

Part I: The Probabilistic Lambda-Calculus and its Semantics -- Introduction -- Syntax and Operational Semantics -- The Working Probabilistic Lambda Calculus -- Properties of the Markov Chain Semantics -- Denotational Semantics -- Semantical Correspondences -- Categorical Treatment -- Probabilism and Non-Determinism -- Part II: Natural Probabilistic Reasoning -- On Natural Two-Tier Semantics for Propositional Logics -- Natural Semantics of Propositions -- Finite Discrete Stochastics Reconsidered -- Lambda-Calculus Definitions -- Markov Chains -- Basic Logic Language and Semantics Definitions -- References -- Index.

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.

ISBN: 9783642551987

Standard No.: 10.1007/978-3-642-55198-7doiSubjects--Topical Terms:

701604
Lambda calculus.

LC Class. No.: QA9.5

Dewey Class. No.: 511.35

Semantics of the probabilistic typed lambda calculus = Markov chain semantics, termination behavior, and denotational semantics /
LDR:02859nmm a2200337 a 4500 001 2092586
003 DE-He213
005 20170302055418.0
006 m d
007 cr nn 008maaau
008 171117s2017 gw s 0 eng d
020 $a 9783642551987 $q (electronic bk.)
020 $a 9783642551970 $q (paper)
024 7 $a 10.1007/978-3-642-55198-7 $2 doi
035 $a 978-3-642-55198-7
040 $a GP $c GP
041 0 $a eng
050 4 $a QA9.5
072 7 $a UY $2 bicssc
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a COM031000 $2 bisacsh
082 0 4 $a 511.35 $2 23
090 $a QA9.5 $b .D759 2017
100 1 $a Draheim, Dirk. $3 896126
245 1 0 $a Semantics of the probabilistic typed lambda calculus $h [electronic resource] : $b Markov chain semantics, termination behavior, and denotational semantics / $c by Dirk Draheim.
260 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2017.
300 $a viii, 218 p. : $b ill., digital ; $c 24 cm.
505 0 $a Part I: The Probabilistic Lambda-Calculus and its Semantics -- Introduction -- Syntax and Operational Semantics -- The Working Probabilistic Lambda Calculus -- Properties of the Markov Chain Semantics -- Denotational Semantics -- Semantical Correspondences -- Categorical Treatment -- Probabilism and Non-Determinism -- Part II: Natural Probabilistic Reasoning -- On Natural Two-Tier Semantics for Propositional Logics -- Natural Semantics of Propositions -- Finite Discrete Stochastics Reconsidered -- Lambda-Calculus Definitions -- Markov Chains -- Basic Logic Language and Semantics Definitions -- References -- Index.
520 $a 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.
650 0 $a Lambda calculus. $3 701604
650 0 $a Computer science $x Mathematics. $3 532725
650 0 $a Semantic computing. $3 1067496
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Theory of Computation. $3 892514
650 2 4 $a Programming Languages, Compilers, Interpreters. $3 891123
650 2 4 $a Probability and Statistics in Computer Science. $3 891072
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
856 4 0 $u http://dx.doi.org/10.1007/978-3-642-55198-7
950 $a Computer Science (Springer-11645)