Geometry of interaction III: accommodating the additives
Proceedings of the workshop on Advances in linear logic
Information and Computation
Game semantics and abstract machines
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Slot games: a quantitative model of computation
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Context Semantics, Linear Logic and Computational Complexity
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Elementary Complexity and Geometry of Interaction
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
A semantic measure of the execution time in linear logic
Theoretical Computer Science
Estimation of the length of interactions in arena game semantics
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
| Hi-index | 0.00 |
We present a game-based semantic framework in which the time complexity of any IMELLproof can be read out of its interpretation. This gives a compositional view of the geometry of interaction framework introduced by the first author. In our model the time measure is given by means of slots, as introduced by Ghica in a recent paper. The cost associated to a strategy is polynomially related to the normalization time of the interpreted proof, in the style of a complexity-theoretical full abstraction result.