We introduce basic language constructs and a type discipline as a foundation of structured
communication-based concurrent programming. The constructs, which are easily …

We present a reconstruction of session types in a linear pi calculus where types are qualified
as linear or unrestricted. Linearly qualified communication channels are guaranteed to occur …

Previous work on type-theoretic foundations for object-oriented programming languages has
mostly focussed on applying or extending functional type theory to functional “objects.“This …

We extend the π-calculus with polyadic synchronisation, a generalisation of the
communication mechanism which allows channel names to be composite. We show that this …

A programming style based on concurrent objects arises almost inevitably in languages
where processes communicate by exchanging data on channels. Using the pict language as …

Based on a name-passing calculus and on its ty** system the paper shows how to build
several language constructors towards a strongly-typed object-oriented concurrent …

Session types have emerged as a ty** discipline for communication protocols. Existing
calculi with session types come equipped with many different primitives that combine …

1 Introduction An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis Page
1 Javier Esparza1 and Jens Knoop2 1 Technische Universit at M unchen, Arcisstr. 21, D-80290 …

An interpretation of Abadi and Cardelli's first-order functionobject calculusinto a typedπ-
calculus is presented. The interpretation validates the subty** relation and the ty** …

We present a new type system for TyCO, a name-passing calculus of concurrent objects.
The system captures dynamic aspects of objects' behaviours, namely non-uniform service …