A game semantics of idealized CSP

  • Laird J
  • 5

    Readers

    Mendeley users who have this article in their library.
  • 11

    Citations

    Citations of this article.

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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • J. Laird

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free