A probabilistic powerdomain of evaluations
Proceedings of the Fourth Annual Symposium on Logic in computer science
PCF extended with real numbers
Theoretical Computer Science - Special issue on real numbers and computers
Full abstraction for idealized Algol with passive expressions
Theoretical Computer Science - Special issue on linear logic, 1
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
On full abstraction for PCF: I, II, and III
Information and Computation
Hereditarily Sequential Functionals
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Generalised Flowcharts and Games
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A New Approach to Control Flow Analysis
CC '98 Proceedings of the 7th International Conference on Compiler Construction
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Games and Full Abstraction for FPC
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Bisimulation for Labelled Markov Processes
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Full abstraction for functional languages with control
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Semantics of Exact Real Arithmetic
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A Logical Characterization of Bisimulation for Labeled Markov Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Game Semantics for General References
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Concurrent Games and Full Completeness
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Game Semantics for Finite Nondeterminism
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Non-Deterministic Games and Program Analysis: An Application to Security
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Adequacy for Algebraic Effects
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Model Checking Algol-Like Languages Using Game Semantics
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
On Köthe sequence spaces and linear logic
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
A Quantum Game Semantics for the Measurement Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic coherence spaces as a model of higher-order probabilistic computation
Information and Computation
Information flow for Algol-like languages
Computer Languages, Systems and Structures
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Distributed Probabilistic and Quantum Strategies
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
A category of HO/N-style games and probabilistic strategies is developed where the possible choices of a strategy are quantified 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.