A fully abstract game semantics for countable nondeterminism
From MaRDI portal
Publication:5079748
DOI10.4230/LIPICS.CSL.2018.24MaRDI QIDQ5079748FDOQ5079748
Authors: William John Gowers, James Laird 
Publication date: 28 May 2022
Recommendations
- Nondeterminism in game semantics via sheaves
- Sequential algorithms for unbounded nondeterminism
- Countable nondeterminism and random assignment
- Foundations of Software Science and Computation Structures
- There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
Cites Work
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strategies as profunctors
- Unbounded Non-determinism in CSP
- Title not available (Why is that?)
- Games and full completeness for multiplicative linear logic
- Infinite trace equivalence
- Title not available (Why is that?)
- Nondeterminism in game semantics via sheaves
- Sequential algorithms for unbounded nondeterminism
- Definability and full abstraction
- Thin games with symmetry and concurrent Hyland-Ong games
- Block structure vs scope extrusion: between innocence and omniscience
Cited In (3)
This page was built for publication: A fully abstract game semantics for countable nondeterminism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5079748)
