Angelic semantics of fine-grained concurrency

&
Annals of Pure and Applied Logic 151 (2-3):89-114 (2008)
  Copy   BIBTEX

Abstract

We introduce a game model for an Algol-like programming language with primitives for parallel composition and synchronization on semaphores. The semantics is based on a simplified version of Hyland–Ong-style games and it emphasizes the intuitive connection between the concurrent nature of games and that of computation. The model is fully abstract for may-equivalence

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2007.10.005

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,388

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A game semantics for disjunctive logic programming.Thanos Tsouanas - 2013 - Annals of Pure and Applied Logic 164 (11):1144-1175.
A Tale of Additives and Concurrency in Game Semantics.Pierre Clairambault - 2023 - In Alessandra Palmigiano & Mehrnoosh Sadrzadeh, Samson Abramsky on Logic and Structure in Computer Science and Beyond. Springer Verlag. pp. 363-414.
Polarized games.Olivier Laurent - 2004 - Annals of Pure and Applied Logic 130 (1-3):79-123.
Petri nets, Horn programs, Linear Logic and vector games.Max I. Kanovich - 1995 - Annals of Pure and Applied Logic 75 (1-2):107-135.
A game semantics of names and pointers.J. Laird - 2008 - Annals of Pure and Applied Logic 151 (2-3):151-169.
An approach to deciding the observational equivalence of Algol-like languages.C. -H. L. Ong - 2004 - Annals of Pure and Applied Logic 130 (1-3):125-171.
Resource modalities in tensor logic.Paul-André Melliès & Nicolas Tabareau - 2010 - Annals of Pure and Applied Logic 161 (5):632-653.
An infinite-game semantics for well-founded negation in logic programming.Chrysida Galanaki, Panos Rondogiannis & William W. Wadge - 2008 - Annals of Pure and Applied Logic 151 (2-3):70-88.
Full abstraction for Reduced ML.Andrzej S. Murawski & Nikos Tzevelekos - 2013 - Annals of Pure and Applied Logic 164 (11):1118-1143.
Imperative programs as proofs via game semantics.Martin Churchill, Jim Laird & Guy McCusker - 2013 - Annals of Pure and Applied Logic 164 (11):1038-1078.

Analytics

Added to PP
2013-12-26

Downloads
21 (#1,049,356)

6 months
2 (#1,294,541)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references