Computer Science – Logic in Computer Science
Scientific paper
2011-12-13
Computer Science
Logic in Computer Science
Foundations of Software Science and Computational Structures 14th International Conference, FOSSACS 2011, Saarbr\"ucken : Germ
Scientific paper
10.1007/978-3-642-19805-2_23
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.
No associations
LandOfFree
Estimation of the length of interactions in arena game semantics 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 Estimation of the length of interactions in arena game semantics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Estimation of the length of interactions in arena game semantics will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-224127