Subtyping for session types in the pi calculus

Gay, Simon J.; Hole, Malcolm

doi:10.1007/s00236-005-0177-z

Cited by 308 publications

(586 citation statements)

References 26 publications

Supporting

Mentioning

581

Contrasting

Order By: Relevance

“…The subtyping relation for session types has been originally introduced by Gay and Hole [2005] and later explored in a semantic framework by Castagna et al [2009], Padovani [2011b], and by Barbanera and de'Liguoro [2010]. The subtyping relations defined in these works do not guarantee liveness in multi-party sessions (see Section 1).…”

Section: Discussionmentioning

confidence: 99%

“…The adoption of fair termination to characterize the correctness of multi-party sessions has dramatic effects on the subtyping relation for session types [Gay and Hole, 2005;Castagna et al, 2009]. Subtyping is a compatibility relation between types such that, when T is a subtype of S, it is harmless to replace an endpoint with type S with another one with type T or, equivalently, it is harmless to replace a process that behaves according to T with another one that behaves according to S. For example, the session type T defined above is a subtype of seller!Done.end: using an endpoint of type seller!Done.end means sending a Done message to process seller.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Fair Subtyping for Multi-party Session Types

Padovani

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Fair Subtyping for Multi-party Session Types

Padovani

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…To illustrate the need for a theory of subtyping for session types, consider the example of a server for mathematical operations (Gay and Hole, 2005). There are two services: addition of integers, which produces an integer result, and testing of integers for equality, which produces a boolean result.…”

Section: Session Types and Subtypingmentioning

confidence: 99%

“…We will now give pi calculus definitions, following the example of Gay and Hole (2005). The core of the server process is serverbody, parameterised by its channel endpoint x.…”

Section: Channel-oriented Subtypingmentioning

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

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

“…The rules are mostly standard from the literature of subtyping in session types [5] and singleton types [14]. For conciseness we only consider session subtyping for input and output types.…”

Section: Subtyping and Knowledgementioning

confidence: 99%

Certifying Data in Multiparty Session Types

Toninho¹,

Yoshida²

2016

A List of Successes That Can Change the World

View full text Add to dashboard Cite

Multiparty session types (MPST) are a typing discipline for ensuring the coordination of multi-agent communication in concurrent and distributed programs. The original MPST framework mainly focuses on the communication aspects of concurrency, unable to capture important data invariants in communicating programs. This work introduces value dependent types to the MPST framework in order to increase its expressiveness for certifying invariants of data exchanged among multiple participants. The key idea is to impose constraints on the exchanged data, which is explicitly witnessed at runtime by proof objects. The enriched MPST framework provides programmers with a precise global description of the interaction and data dependent patterns, from which local (data dependent) descriptions can be automatically generated for each endpoint, faithfully capturing at a local level the global data constraints. The framework ensures the absence of communication errors and guarantees communication progress in well-typed multiparty sessions. We also develop an extension of value dependencies based on proof irrelevance that enables the selective erasure of proof objects at runtime.

show abstract

Subtyping for session types in the pi calculus

Cited by 308 publications

References 26 publications

Fair Subtyping for Multi-party Session Types

Fair Subtyping for Multi-party Session Types

Subtyping Supports Safe Session Substitution

Certifying Data in Multiparty Session Types

Contact Info

Product

Resources

About