Estimation of the length of interactions in arena game semantics

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 lambdacalculus. Because of the operational content of game semantics, the bounds presented here also apply to head linear reduction on lambda-terms and to the execution of programs by abstract machines (PAM/KAM), including in presence of computational effects such as non-determinism 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 analyzed independently of game semantics or lambda-calculus.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [23 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00651555
Contributor : Pierre Clairambault <>
Submitted on : Tuesday, December 13, 2011 - 6:06:08 PM
Last modification on : Friday, January 4, 2019 - 5:32:59 PM
Document(s) archivé(s) le : Wednesday, March 14, 2012 - 2:36:40 AM

Files

fossacs2011.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Pierre Clairambault. Estimation of the length of interactions in arena game semantics. Foundations of Software Science and Computational Structures 14th International Conference, FOSSACS 2011, Mar 2011, Saarbrücken, Germany. pp.335-349, ⟨10.1007/978-3-642-19805-2_23⟩. ⟨hal-00651555⟩

Share

Metrics

Record views

811

Files downloads

68