Estimation of the length of interactions in arena game semantics

Authors:
Pierre Clairambault
Affiliations:
University of Bath
Venue:
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Year:
2011

Citing 13
Cited 0

Head linear reduction and pure proof net extraction

MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
A semantics of evidence for classical arithmetic

Journal of Symbolic Logic
Light linear logic

Information and Computation
Games and full abstraction for FPC

Information and Computation - Special issue: LICS 1996—Part 1
On full abstraction for PCF: I, II, and III

Information and Computation
Infinite normal forms for the lambda - calculus

Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory
Call-by-Value Games

CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Game semantics and abstract machines

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Full abstraction for functional languages with control

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Game Semantics for Finite Nondeterminism

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A game semantics of the asynchronous π-calculus

CONCUR 2005 - Concurrency Theory
Categorical Combinatorics for Innocent Strategies

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Quantitative Game Semantics for Linear Logic

CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

We estimate the maximal length of interactions between strategies in HO/N game semantics, in the spirit of the work by Schwichtenberg and Beckmann for the length of reduction in simply typed λ-calculus. Because of the operational content of game semantics, the bounds presented here also apply to head linear reduction on λ-terms and to the execution of programs by abstract machines (PAM/KAM), including in presence of computational effects such as nondeterminism or ground type references. The proof proceeds by extracting from the games model a combinatorial rewriting rule on trees of natural numbers, which can then be analysed independently of game semantics or λ-calculus.