A game semantics of idealized CSP

11Citations
Citations of this article
0Readers
Mendeley users who have this article in their library.

Abstract

A games semantics is described for a typed functional language which includes primitives for parallel composition and for synchronous communication on private channels. The semantics is based on a category obtained by extending "Hyland-Ong games" with a representation of multiple threads of control using "concurrency pointers" which express a new kind of causality relation between moves. The semantics is proved to be fully abstract for "channel-free" types with respect to a may-and-must equivalence for the finitary fragment, and with respect to may-equivalence for the whole language, using factorization results to reduce definability to the sequential case. © 2001 Published by Elsevier Science B.V.

Cite

CITATION STYLE

APA

Laird, J. (2001). A game semantics of idealized CSP. In Electronic Notes in Theoretical Computer Science (Vol. 45, pp. 241–266). https://doi.org/10.1016/S1571-0661(04)80965-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free