Pages that link to "Item:Q2503039"
From MaRDI portal
The following pages link to Asynchronous games. II: The true concurrency of innocence (Q2503039):
Displaying 15 items.
- Realizability for Peano arithmetic with winning conditions in HON games (Q345704) (← links)
- An approach to innocent strategies as graphs (Q418201) (← links)
- Proof and refutation in MALL as a game (Q636305) (← links)
- Interpreting a finitary pi-calculus in differential interaction nets (Q979075) (← links)
- Deterministic concurrent strategies (Q1941878) (← links)
- On dialogue games and graph games (Q2130592) (← links)
- A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus (Q2988382) (← links)
- Constructing Differential Categories and Deconstructing Categories of Games (Q3012919) (← links)
- Understanding Game Semantics Through Coherence Spaces (Q3178256) (← links)
- Automated Synthesis of Distributed Controllers (Q3449462) (← links)
- Parsimonious Types and Non-uniform Computation (Q3449488) (← links)
- Partial Orders, Event Structures and Linear Strategies (Q3637188) (← links)
- The true concurrency of differential interaction nets (Q4577982) (← links)
- Monoidal-closed categories of tree automata (Q5220183) (← links)
- Infinitary affine proofs (Q5268998) (← links)
