DocumentCode
2221921
Title
Probabilistic game semantics
Author
Danos, Vincent ; Harmer, Russell
Author_Institution
Equipe PPS, Paris VII Univ., France
fYear
2000
fDate
2000
Firstpage
204
Lastpage
213
Abstract
A category of HO/N-style games and probabilistic strategies is developed where the possible choices of a strategy are quantified so as to give a measure of the likelihood of seeing a given play. A 2-sided die is shown to be universal in this category, in the sense that any strategy breaks down into a composition between some deterministic strategy and that die. The interpretative power of the category is then demonstrated by delineating a Cartesian closed subcategory which provides a fully abstract model of a probabilistic extension of Idealized Algol
Keywords
ALGOL; category theory; game theory; probability; programming language semantics; 2-sided die; Cartesian closed subcategory; HO/N-style games; Idealized Algol; deterministic strategy; fully abstract model; interpretative power; probabilistic extension; probabilistic game semantics; probabilistic strategies; Game theory; Image reconstruction; Machinery; Random variables; Tensile stress; Uncertainty;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 2000. Proceedings. 15th Annual IEEE Symposium on
Conference_Location
Santa Barbara, CA
ISSN
1043-6871
Print_ISBN
0-7695-0725-5
Type
conf
DOI
10.1109/LICS.2000.855770
Filename
855770
Link To Document