Asynchronous games: innocence without alternation

Details Asynchronous games: innocence without alternation Asynchronous games: innocence without alternation

2007-06-08

arxiv.org/abs/0706.1118v1

Computer Science

Logic in Computer Science

Scientific paper

The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of lambda-terms and PCF programs. An innocent strategy is defined as an alternating strategy with partial memory, in which the strategy plays according to its view. Extending the definition to non-alternating strategies is problematic, because the traditional definition of views is based on the hypothesis that Opponent and Proponent alternate during the interaction. Here, we take advantage of the diagrammatic reformulation of alternating innocence in asynchronous games, in order to provide a tentative definition of innocence in non-alternating games. The task is interesting, and far from easy. It requires the combination of true concurrency and game semantics in a clean and organic way, clarifying the relationship between asynchronous games and concurrent games in the sense of Abramsky and Melli\`es. It also requires an interactive reformulation of the usual acyclicity criterion of linear logic, as well as a directed variant, as a scheduling criterion.

Affiliated with

Also associated with

No associations

Rating

Asynchronous games: innocence without alternation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asynchronous games: innocence without alternation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asynchronous games: innocence without alternation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-652542