A Game Semantics of Idealized CSP
From MaRDI portal
Publication:4917059
DOI10.1016/S1571-0661(04)80965-4zbMath1260.68051OpenAlexW2084224236MaRDI QIDQ4917059
No author found.
Publication date: 26 April 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80965-4
Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)
Related Items (9)
Full Abstraction Without Synchronization Primitives ⋮ Higher-order linearisability ⋮ A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus ⋮ Angelic semantics of fine-grained concurrency ⋮ A game semantics of names and pointers ⋮ Asynchronous games. II: The true concurrency of innocence ⋮ Unnamed Item ⋮ A Categorical Semantics of Higher Order Store ⋮ Handshake Games
Cites Work
- A mathematical semantics for a nondeterministic typed lambda-calculus
- On full abstraction for PCF: I, II and III
- Communicating sequential processes
- Games and full completeness for multiplicative linear logic
- Game theoretic analysis of call-by-value computation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A Game Semantics of Idealized CSP
