Asynchronous games. II: The true concurrency of innocence
From MaRDI portal
Publication:2503039
DOI10.1016/j.tcs.2006.01.016zbMath1099.68072OpenAlexW1995251574MaRDI QIDQ2503039
Publication date: 13 September 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.01.016
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Combinatory logic and lambda calculus (03B40)
Related Items (15)
On dialogue games and graph games ⋮ Automated Synthesis of Distributed Controllers ⋮ Parsimonious Types and Non-uniform Computation ⋮ Understanding Game Semantics Through Coherence Spaces ⋮ Realizability for Peano arithmetic with winning conditions in HON games ⋮ The true concurrency of differential interaction nets ⋮ An approach to innocent strategies as graphs ⋮ Deterministic concurrent strategies ⋮ Proof and refutation in MALL as a game ⋮ A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus ⋮ Constructing Differential Categories and Deconstructing Categories of Games ⋮ Interpreting a finitary pi-calculus in differential interaction nets ⋮ Monoidal-closed categories of tree automata ⋮ Partial Orders, Event Structures and Linear Strategies ⋮ Infinitary affine proofs
Cites Work
- Fully abstract models of typed \(\lambda\)-calculi
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Sequentiality vs. concurrency in games and logic
- Geometry and concurrency: a user's guide
- A Game Semantics of Idealized CSP
- Foundations of Software Science and Computation Structures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Asynchronous games. II: The true concurrency of innocence
