30 search results - page 4 / 6 » Game Semantics for Higher-Order Concurrency |
TLCA
2009
Springer
14 years 1 months ago
2009
Springer
We introduce a Game Semantics where strategies are partial orders, and composition is a generalization of the merging of orders. Building on this, to bridge between Game Semantics ...
NJC
2002
13 years 7 months ago
2002
The tcc model is a formalism for reactive concurrent constraint programming. We present a model of temporal concurrent constraint programming which adds to tcc the capability of mo...
ICALP
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. We consider a finitary procedural programming language (finite data-types, no recursion) extended with parallel composition and binary semaphores. Having first shown t...
CONCUR
2007
Springer
14 years 1 months ago
2007
Springer
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...