Polarized games

Olivier, Laurent

doi:10.1109/lics.2002.1029835

Cited by 41 publications

(50 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The present work has a close connection with recent studies on control from a proof-theoretic viewpoint, notably Polarised Linear Logic by Laurent [22,23] and λµμ-calculus by Curien and Herbelin [7]. The type structures for the linear/affine π-calculi are based on duality, here arising in a simplest possible way, as mutually dual input and output modes of channel types.…”

Section: Control As Proofs and Control As Processesmentioning

confidence: 67%

Process Types as a Descriptive Tool for Interaction

Honda

Yoshida

Berger

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We demonstrate a tight relationship between linearly typed π-calculi and typed λ-calculi by giving a type-preserving translation from the call-by-value λµ-calculus into a typed π-calculus. The λµ-calculus has a particularly simple representation as typed mobile processes. The target calculus is a simple variant of the linear π-calculus. We establish full abstraction up to maximally consistent observational congruences in source and target calculi using techniques from games semantics and process calculi.

show abstract

Section: Control As Proofs and Control As Processesmentioning

confidence: 67%

Process Types as a Descriptive Tool for Interaction

Honda

Yoshida

Berger

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The other major source of inspiration is prooftheory in formal logic, in particular proof-nets in Linear Logic [16] which offer a totally desequentialised representation of logical inferences as a graph, similar to our negotiation graphs (inferences are here negotiation decisions). The game theoretic interpretation of proofs [17] has also strongly influenced our view of negotiation as games.…”

Section: Discussionmentioning

confidence: 99%

Negotiation as a Generic Component Coordination Primitive

Andreoli

Castellani

2003

Distributed Applications and Interoperable Systems

View full text Add to dashboard Cite

Abstract. In this paper, we claim that negotiation is a powerful abstract notion for the coordination of distributed autonomous components, and is therefore a suitable candidate for the definition of a generic coordination middleware tool, at the same level as transactions or messaging. Although specific negotiation mechanisms have been proposed in various application contexts, there is still a need to define a truely generic concept of negotiation, suitable for a middleware layer. This paper provides some elements towards the definition of such a concept. A salient feature of our proposal is that it introduces a rich representation of the state of a negotiation, inspired by proof-nets in Linear Logic and their game semantics, well beyond the traditional state-transition graphs. Furthermore, this representation is entirely decoupled from the dynamics of the negotiation processes that may use it, and hence avoids to rely on any specific "rule of the game" as to how a negotiation should proceed. It can thus adapt to any such rule, the definition of which is delegated to the negotiating components themselves.

show abstract

“…We follow essentially the constructions of Honda and Yoshida [7] or variants described by Laurent [13]. In each case the group action on compound arenas is defined pointwise.…”

Section: A Call-by-value Category Of Gamesmentioning

confidence: 99%

“…The categorical properties required in [23] to interpret the nu-calculus may be summarised as follows: -To interpret the call-by-value λ-calculus, a sound model of Moggi's computational metalanguage. -To interpret the type o of booleans, a disjoint coproduct of the terminal object (of νG t ) with itself -νG in fact has all small coproducts, obtained by taking the disjoint sum of arenas [13], thus I + I is the arena with two distinct initial answer moves, invariant under G-action. -To interpret the type ν of names, a distinguished decidable object N -in νG this is the ν-arena with a set of initial answer-moves indexed over N, which are acted on according to their indices:…”

Section: Semantics Of λν!mentioning

confidence: 99%

A Game Semantics of Local Names and Good Variables

Laird

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We describe a game semantics for local names in a functional setting. It is based on a category of dialogue games acted upon by the automorphism group of the natural numbers; this allows properties of names such as freshness and locality to be characterized semantically. We describe a model of the nu-calculus in this category, and extend it with named references (without bad variables) using names as pointers to a store. After refining the semantics via a notion of garbage collection, we prove that the compact elements are definable as terms, and hence obtain a full abstraction result.

show abstract

Polarized games

Cited by 41 publications

References 21 publications

Process Types as a Descriptive Tool for Interaction

Process Types as a Descriptive Tool for Interaction

Negotiation as a Generic Component Coordination Primitive

A Game Semantics of Local Names and Good Variables

Contact Info

Product

Resources

About