• Corpus ID: 20868

# A Game Semantics of the Asynchronous π-Calculus

@inproceedings{Laird2005AGS,
title={A Game Semantics of the Asynchronous $\pi$-Calculus},
author={James David Laird},
year={2005}
}
This paper studies the denotational semantics of the typed asynchronous π-calculus. We describe a simple game semantics of this language, placing it within a rich hierarchy of games models for programming languages, A key element of our account is the identification of suitable categorical structures for describing the interpretation of types and terms at an abstract level. It is based on the notion of closed Freyd category, establishing a connection between our semantics, and that of the…
Game Semantics for Type Soundness
• Computer Science
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
• 2015
This paper uses game semantics to define the meaning of and verify type soundness for a sequence of programming languages, starting with a functional sequential language (the call-by-value simply-typed lambda calculus) and then extending that proof with sub typing, side effects, control effects, and concurrency.
A Categorical Model of an i / o-typed π -calculus
• Computer Science, Mathematics
• 2019
It is shown by a semantic consideration that the π -calculus is equivalent to a core calculus of Concurrent ML, in the same way that a cartesian closed category is a model of the λ-calculus.
Full Abstraction in a Subtyped pi-Calculus with Linear Types
• Computer Science
CONCUR
• 2011
A concise pi-calculus with directed choices and a theory of subtyping, which shows type-directed embeddings of two known subtyped calculi, one for functions and another for session-based communications, and introduces a new proof method centring on non-deterministic computational adequacy and definability.
A calculus of coroutines
• J. Laird
• Mathematics, Computer Science
Theor. Comput. Sci.
• 2004
Operational Nominal Game Semantics
This work presents a formal correspondence between Laird’s trace semantics and the nominal game model of Murawski and Tzevelekos for RefML, a callby-value language with higher-order references, and gives the first fully abstract trace model for this language.
Typed Event Structures and the π-Calculus – Extended
• Computer Science
The typing system proposed is the first typing system to control behaviour in a true concurrent model of event structures and generalises Winskel’s original event structure semantics of CCS.
A Truly Concurrent Game Model of the Asynchronous \pi -Calculus
• Computer Science
FoSSaCS
• 2017
A truly concurrent version of the HO/N game model in which a play is not a sequence but a directed acyclic graph DAG with two kinds edges, justification pointers and causal edges is proposed, giving the first truly concurrent game semantics for the asynchronous $$\pi$$-calculus.
Games, Mobile Processes, and Functions
• Computer Science
CSL
• 2022
A tight connection is established between two models of the λ-Calculus, namely Milner’s encoding into the π-calculus, and operational game semantics (OGS), and the equivalences induced by all these LTSs coincide, which allow for transfer results and techniques between π and OGS.
From Asynchronous Games to Concurrent Games
It is shown here that asynchronous games, which combine true concurrency and game semantics, can be used to provide a precise link between these two kind of interactive semantics, thus laying foundations for game semantics of concurrent systems.

## References

SHOWING 1-10 OF 31 REFERENCES
Sequentiality and the π-Calculus
• Computer Science
• 2001
The result shows how a typed π-calculus can be used as a descriptive tool for a significant class of programming languages without losing the latter’s semantic properties.
The π-calculus is a model of concurrent computation based upon the notion of naming that is generalized from monadic to polyadic form and semantics is done in terms of both a reduction system and a version of labelled transitions called commitment.
A Game Semantics of Local Names and Good Variables
After refining the semantics via a notion of garbage collection, it is proved that the compact elements are definable as terms, and hence obtain a full abstraction result.
The regular-language semantics of second-order idealized ALGOL
• Computer Science
• 2003
We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized ALGOL (IA) by expressing sets of complete plays as
Full Abstraction for PCF
• Computer Science
Inf. Comput.
• 1994
The effective version of the model is considered and it is proved that every element of the effective extensional model is definable in PCF, which is the first syntax-independent description of the fully abstract model for PCF.
Contextual equivalence for higher-order pi-calculus revisited
• Computer Science, Mathematics
Log. Methods Comput. Sci.
• 2005
This calculus is revisited and an alternative presentation of the labelled transition system and a novel proof technique is offered which allows to provide a fully abstract characterisation of contextual equivalence using labelled transitions and bisimulations for higher-order pi-calculus with recursive types also.
A fully abstract game semantics for finite nondeterminism
• Computer Science
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)
• 1999
This model is shown to be fully abstract, with respect to an equivalence based on both safety and liveness properties, by means of a factorization theorem which states that every nondeterministic strategy is the composite of a deterministic strategy with a nondetergetic oracle.
On Full Abstraction for PCF: I, II, and III
• Computer Science
Inf. Comput.
• 2000
An order-extensional, order (or inequationally) fully abstract model for Scott's language pcf, based on a kind of game in which each play consists of a dialogue of questions and answers between two players who observe the following principles of civil conversation.
Games and Full Abstraction for a Functional Metalanguage with Recursive Types
This book discusses FPC and its Models, Rational Categories and Recursive Types, and Semantics of the Recursion Combinator, as well as games and Strategies, and the author's own contributions.