ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
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
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
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Categorical Combinatorics for Innocent Strategies
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Some Programming Languages Suggested by Game Models (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Ludics with Repetitions (Exponentials, Interactive Types and Completeness)
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Imperative Programs as Proofs via Game Semantics
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We present a calculus which combines a simple, CCS-like representation of finite behaviors, with two dual binders λ and λ¯. Infinite behaviors are obtained through a syntactical fixed-point operator, which is used to give a translation of λ-terms. The duality of the calculus makes the roles of a function and its environment symmetrical. As usual, the environment is allowed to call a function at any given point, each time with a different argument. Dually, the function is allowed to answer any given call, each time with a different behavior. This grants terms in our language the power of functional references. The inspiration for this language comes from game semantics. Indeed, its normal forms give a simple concrete syntax for finite strategies, which are inherently non-innocent. This very direct correspondence allows us to describe, in syntactical terms, a number of features from game semantics. The fixed-point expansion of translated λ-terms corresponds to the generation of infinite plays from the finite views of an innocent strategy. The syntactical duality between terms and co-terms corresponds to the duality between Player and Opponent. This duality also gives rise to a Böhm-out lemma. The paper is divided into two parts. The first one is purely syntactical, and requires no background in game semantics. The second describes the fully abstract game model.