Estimation of the length of interactions in arena game semantics
Clairambault, P., 2011. Estimation of the length of interactions in arena game semantics. In: Foundations of Software Science and Computational Structures - 14th Int. Conf., FOSSACS 2011, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Proceedings. Vol. 6604 LNCS. Heidelberg: Springer, pp. 335-349. (Lecture Notes in Computer Science)
Related documents:This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below.
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 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 analysed independently of game semantics or -calculus.
|Item Type||Book Sections|
|Departments||Faculty of Science > Computer Science|
|Additional Information||14th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2011, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011. 26 March - 3 April 2011. Saarbrucken, Germany.|
Actions (login required)