The following pages link to (Q4225150):
Displaying 20 items.
- On concurrent games with payoff (Q265795) (← links)
- Realizability for Peano arithmetic with winning conditions in HON games (Q345704) (← links)
- Reasoning about equilibria in game-like concurrent systems (Q345709) (← links)
- Imperative programs as proofs via game semantics (Q388203) (← links)
- A graphical foundation for interleaving in game semantics (Q479313) (← links)
- Totality in arena games (Q636307) (← links)
- Glueing and orthogonality for models of linear logic (Q1398466) (← links)
- Comparing hierarchies of types in models of linear logic (Q1881220) (← links)
- An approach to deciding the observational equivalence of Algol-like languages (Q1886322) (← links)
- Deterministic concurrent strategies (Q1941878) (← links)
- On dialogue games and graph games (Q2130592) (← links)
- A game-semantic model of computation (Q2319854) (← links)
- Asynchronous games. II: The true concurrency of innocence (Q2503039) (← links)
- Some Programming Languages Suggested by Game Models (Extended Abstract) (Q2805154) (← links)
- Game Semantics for Access Control (Q2805155) (← links)
- Interpreting Localized Computational Effects Using Operators of Higher Type (Q3507453) (← links)
- Dynamic game semantics (Q4988428) (← links)
- (Q5089017) (← links)
- Monoidal-closed categories of tree automata (Q5220183) (← links)
- GAME FORMATS AS CHU SPACES (Q5294345) (← links)
