Alexis Goyet
ABSTRACT
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.
Supplemental Material
- S. Abramsky, K. Honda, and G. McCusker. A fully abstract game semantics for general references. In Logic in Computer Science, 1998. Proceedings. Thirteenth Annual IEEE Symposium on, pages 334--344. IEEE, 1998. Google Scholar
Digital Library
- S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for pcf. Information and Computation, 163(2):409--470, 2000. Google ScholarDigital Library
- S. Abramsky and G. McCusker. Linearity, sharing and state: a fully abstract game semantics for idealized algol with active expressions. In Algol-like languages. Citeseer, 1997.Google Scholar
- H.P. Barendregt. The lambda calculus: its syntax and semantics, volume 103. North Holland, 1984.Google Scholar
- M. Basaldella and C. Faggian. Ludics with repetitions (exponentials, interactive types and completeness). In Logic In Computer Science, 2009. LICS'09. 24th Annual IEEE Symposium on, pages 375--384. IEEE, 2009. Google ScholarDigital Library
- M. Churchill and J. Laird. A logic of sequentiality. In Computer Science Logic, pages 215--229. Springer, 2010. Google ScholarDigital Library
- M. Churchill, J. Laird, and G. McCusker. Imperative programs as proofs via game semantics. In Logic in Computer Science (LICS), 2011 26th Annual IEEE Symposium on, pages 65--74. IEEE, 2011. Google ScholarDigital Library
- P.L. Curien and H. Herbelin. The duality of computation. In ACM sigplan notices, volume 35, pages 233--243. ACM, 2000. Google ScholarDigital Library
- P.L. Curien and H. Herbelin. Abstract machines for dialogue games. Arxiv preprint arXiv:0706.2544, 2007.Google Scholar
- A. Goyet. The łlbc, implementation manual. http://www.pps.univ-paris-diderot.fr/ agoyet/llbc.Google Scholar
- R. Harmer, M. Hyland, and P.A. Mellies. Categorical combinatorics for innocent strategies. In Logic in Computer Science, 2007. LICS 2007. 22nd Annual IEEE Symposium on, pages 379--388. IEEE, 2007. Google ScholarDigital Library
- Russ Harmer. Cellular strategies and innocent interaction. Draft.Google Scholar
- H. Herbelin. Games and weak-head reduction for classical pcf. Typed Lambda Calculi and Applications, pages 214--230, 1997. Google ScholarDigital Library
- J.M.E. Hyland and C.H.L. Ong. On full abstraction for pcf: I, II, and III. Information and computation, 163(2):285--408, 2000. Google ScholarDigital Library
- J. Laird. Full abstraction for functional languages with control. In Logic in Computer Science, 1997. LICS'97. Proceedings., 12th Annual IEEE Symposium on, pages 58--67. IEEE, 1997. Google ScholarDigital Library
- J. Longley. Some programming languages suggested by game models. Electronic Notes in Theoretical Computer Science, 249:117--134, 2009. Google ScholarDigital Library
- P.A. Mellies. Asynchronous games 2: the true concurrency of innocence. CONCUR 2004-Concurrency Theory, pages 448--465, 2004.Google ScholarCross Ref
- P.A. Melliès and N. Tabareau. Resource modalities in tensor logic. Annals of Pure and Applied Logic, 161(5):632--653, 2010.Google ScholarCross Ref
- H. Nickau. Hereditarily sequential functionals. Logical Foundations of Computer Science, pages 253--264, 1994. Google ScholarDigital Library
- Vincent Padovani. Decidability of All Minimal Models. http://hal.archives-ouvertes.fr/hal-00741219, 2012.Google Scholar
- J. Parrow and B. Victor. The fusion calculus: Expressiveness and symmetry in mobile processes. In Logic in Computer Science, 1998. Proceedings. Thirteenth Annual IEEE Symposium on, pages 176--185. IEEE, 1998. Google ScholarDigital Library
Index Terms
- The Lambda Lambda-Bar calculus: a dual calculus for unconstrained strategies
Recommendations
The Lambda Lambda-Bar calculus: a dual calculus for unconstrained strategies
POPL '13We 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 ...
Focused Linear Logic and the λ-calculus
Linear logic enjoys strong symmetries inherited from classical logic while providing a constructive framework comparable to intuitionistic logic. However, the computational interpretation of sequent calculus presentations of linear logic remains ...
Intuitionistic differential nets and lambda-calculus
We define pure intuitionistic differential proof nets, extending Ehrhard and Regnier s differential interaction nets with the exponential box of Linear Logic. Normalization of the exponential reduction and confluence of the full one is proved. These ...
Comments