Locally Boolean domains
From MaRDI portal
Publication:2566030
DOI10.1016/j.tcs.2005.06.007zbMath1077.68049OpenAlexW1982535387MaRDI QIDQ2566030
Publication date: 22 September 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.06.007
Semantics in the theory of computing (68Q55) Categorical semantics of formal languages (18C50) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Related Items (7)
Imperative programs as proofs via game semantics ⋮ A synthetic theory of sequential domains ⋮ Sequential algorithms for unbounded nondeterminism ⋮ Unnamed Item ⋮ Some Programming Languages Suggested by Game Models (Extended Abstract) ⋮ Nondeterminism and Observable Sequentiality ⋮ A calculus of coroutines
Cites Work
This page was built for publication: Locally Boolean domains