On full abstraction for PCF: I, II, and III
Information and Computation
Polarized proof-nets and λµ-calculus
Theoretical Computer Science
Hereditarily Sequential Functionals
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Games and Weak-Head Reduction for Classical PCF
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Game semantics and abstract machines
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Games and Full Abstraction for FPC
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 General References
LICS '98 Proceedings of the 13th 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
Non-Deterministic Games and Program Analysis: An Application to Security
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Games Characterizing Levy-Longo Trees
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Epistemic Strategies and Games on Concurrent Processes
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
The anatomy of innocence revisited
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Epistemic Strategies and Games on Concurrent Processes
ACM Transactions on Computational Logic (TOCL)
Game Semantics in the Nominal Model
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.01 |
We reveal a symmetric structure in the ho/n games model of innocent strategies, introducing rigid strategies, a concept dual to bracketed strategies. We prove a direct definability theorem of general innocent strategies with respect to a simply typed language of extended Böhm trees, which gives an operational meaning to rigidity in call-byname. A corresponding factorization of innocent strategies into rigid ones with some form of conditional as an oracle is constructed.