Sequential algorithms for unbounded nondeterminism
From MaRDI portal
Publication:5971404
DOI10.1016/j.entcs.2015.12.017zbMath1351.68060OpenAlexW2207126642WikidataQ113317724 ScholiaQ113317724MaRDI QIDQ5971404
No author found.
Publication date: 16 December 2016
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2015.12.017
Related Items
Cites Work
- Sequential algorithms on concrete data structures
- Fully abstract semantics for observably sequential languages
- Locally Boolean domains
- Countable nondeterminism and random assignment
- Bistructures, bidomains and linear logic
- An Alternative Order for the Failures Model
- Bistable Biorders: A Sequential Domain Theory
- Foundations of Software Science and Computation Structures
- Unnamed Item
- Unnamed Item