Session types revisited

Dardha, Ornela; Giachino, Elena; Sangiorgi, Davide

doi:10.1145/2370776.2370794

Cited by 78 publications

(93 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…2. Translation of session types into linear and variant types (Dardha et al, 2012). Data types such as int and bool are translated into themselves.…”

Section: Safe Substitutability Of Channels Formallymentioning

confidence: 99%

“…With this representation, Gay and Hole's definition of subtyping follows by combining the standard definition of subtyping for variants in λ-calculus (Pierce, 2002) with Pierce and Sangiorgi's (1996) definition of subtyping for input and output types in pi calculus. Dardha et al (2012) developed this idea in detail 1 . They showed that not only subtyping, but also polymorphism, can be derived from a translation of session types into linear pi calculus (Kobayashi et al, 1999) with variants.…”

Section: Channel-oriented Subtyping By Translationmentioning

confidence: 99%

See 1 more Smart Citation

Subtyping Supports Safe Session Substitution

Gay¹

2016

A List of Successes That Can Change the World

View full text Add to dashboard Cite

Abstract. Session types describe the structure of bi-directional pointto-point communication channels by specifying the sequence and format of messages on each channel. A session type defines a communication protocol. Type systems that include session types are able to statically verify that communication-based code generates, and responds to, messages according to a specified protocol. It is natural to consider subtyping for session types, but the literature contains conflicting definitions. It is now folklore that one definition is based on safe substitutability of channels, while the other is based on safe substitutability of processes. We explain this point in more detail, and show how to unify the two views.

show abstract

“…2. Translation of session types into linear and variant types (Dardha et al, 2012). Data types such as int and bool are translated into themselves.…”

Section: Safe Substitutability Of Channels Formallymentioning

confidence: 99%

Section: Channel-oriented Subtyping By Translationmentioning

confidence: 99%

Subtyping Supports Safe Session Substitution

Gay¹

2016

A List of Successes That Can Change the World

View full text Add to dashboard Cite

show abstract

“…Within session types, the works [6,5] encode binary sessions into a linearly typed π-calculus. While [6] gives an encoding of π into a linear calculus (an extension of [1]), the work [5] gives operational correspondence (without full abstraction) for the first-and higher-order π-calculi into [13].…”

Section: Concluding Remarks and Related Workmentioning

confidence: 99%

On the Relative Expressiveness of Higher-Order Session Processes

Kouzapas

Pérez

Yoshida

2016

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. By integrating constructs from the λ-calculus and the π-calculus, in higher-order process calculi exchanged values may contain processes. This paper studies the relative expressiveness of HOπ, the higher-order π-calculus in which communications are governed by session types. Our main discovery is that HO, a subcalculus of HOπ which lacks name-passing and recursion, can serve as a new core calculus for session-typed higher-order concurrency. By exploring a new bisimulation for HO, we show that HO can encode HOπ fully abstractly (up to typed contextual equivalence) more precisely and efficiently than the first-order session π-calculus (π). Overall, under session types, HOπ, HO, and π are equally expressive; however, HOπ and HO are more tightly related than HOπ and π.

show abstract

“…In addition to the fact that we consider progress modulo the availability of catalyzers, our type system is given for an asynchronous language with a native notion of (multiparty) session, while Kobayashi's type system is defined for a basic variant of the synchronous, pure π-calculus. A natural way for comparing these analysis techniques would require compiling a session-based process into the pure π-calculus [11], and then using Kobayashi's type system for reasoning on progress of the original process in terms of lock-freedom of the one resulting from the compilation. With this technique we have been able to prove progress for some processes that are ill typed according to the interaction type system.…”

Section: Related Workmentioning

confidence: 99%

Inference of Global Progress Properties for Dynamically Interleaved Multiparty Sessions

Coppo

Dezani‐Ciancaglini

Padovani

et al. 2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

A multiparty session forms a unit of structured interactions among several processes which follow a specified protocol described as a global type. Well-known communication-oriented type systems guarantee communication safety and progress within single sessions, but do not take into account the dependencies arising from the interleaving of simultaneously active sessions and from session delegations. As a consequence, a system of well typed processes may fail to have progress, even assuming that helper processes can join the system after its execution has started. In this paper we develop a static analysis technique, specified as a set of syntax-directed inference rules, that is capable of verifying whether a system of processes engaged in simultaneously active multiparty sessions has the progress property.

show abstract

Session types revisited

Cited by 78 publications

References 15 publications

Subtyping Supports Safe Session Substitution

Subtyping Supports Safe Session Substitution

On the Relative Expressiveness of Higher-Order Session Processes

Inference of Global Progress Properties for Dynamically Interleaved Multiparty Sessions

Contact Info

Product

Resources

About