A fully abstract game semantics for countable nondeterminism
From MaRDI portal
Publication:5079748
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
- scientific article; zbMATH DE number 3714908 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 3729429 (Why is no real title available?)
- scientific article; zbMATH DE number 1231510 (Why is no real title available?)
- Block structure vs scope extrusion: between innocence and omniscience
- Definability and full abstraction
- Full abstraction for PCF
- Games and full completeness for multiplicative linear logic
- Infinite trace equivalence
- Nondeterminism in game semantics via sheaves
- On full abstraction for PCF: I, II and III
- Sequential algorithms for unbounded nondeterminism
- Strategies as profunctors
- Thin games with symmetry and concurrent Hyland-Ong games
- Unbounded Non-determinism in CSP
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)
