Using Session Types for Reasoning About Boundedness in the Pi-Calculus

Algorithmic type checking for a pi-calculus with name matching and session types

The Journal of Logic and Algebraic Programming ◽

10.1016/j.jlap.2013.05.003 ◽

2013 ◽

Vol 82 (8) ◽

pp. 263-281 ◽

Cited By ~ 4

Author(s):

Marco Giunti

Keyword(s):

Type Checking ◽

Session Types ◽

Pi Calculus ◽

Name Matching

Download Full-text

Type Inference for Session Types in the $$\pi $$ -calculus

Lecture Notes in Computer Science - Web Services, Formal Methods, and Behavioral Types ◽

10.1007/978-3-319-33612-1_7 ◽

2016 ◽

pp. 103-121 ◽

Cited By ~ 3

Author(s):

Eva Fajstrup Graversen ◽

Jacob Buchreitz Harbo ◽

Hans Hüttel ◽

Mathias Ormstrup Bjerregaard ◽

Niels Sonnich Poulsen ◽

...

Keyword(s):

Type Inference ◽

Session Types ◽

Pi Calculus

Download Full-text

Linearity, session types and the Pi calculus

Mathematical Structures in Computer Science ◽

10.1017/s0960129514000176 ◽

2014 ◽

Vol 26 (2) ◽

pp. 206-237 ◽

Cited By ~ 4

Author(s):

MARCO GIUNTI ◽

VASCO THUDICHUM VASCONCELOS

Keyword(s):

Communication Channel ◽

Type System ◽

Type Systems ◽

Session Types ◽

Completeness Result ◽

Pi Calculus

We present a type system based on session types that works on a conventional pi calculus. Types are equipped with a constructor that describes the two ends of a single communication channel, this being the only type available for describing the behaviour of channels. Session types, in turn, describe the behaviour of each individual channel end, as usual. A novel notion of typing context split allows for typing processes not typable with extant type systems. We show that our system guarantees that typed processes do not engage in races for linear resources. We assess the expressiveness of the type system by providing three distinct encodings – from the pi calculus with polarized variables, from the pi calculus with accept and request primitives, and from the linear pi calculus – into our system. For each language we present operational and typing correspondences, showing that our system effectively subsumes foregoing works on linear and session types. In the case of the linear pi calculus we also provide a completeness result.

Download Full-text

A Linear Account of Session Types in the Pi Calculus

CONCUR 2010 - Concurrency Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-15375-4_30 ◽

2010 ◽

pp. 432-446 ◽

Cited By ~ 11

Author(s):

Marco Giunti ◽

Vasco T. Vasconcelos

Keyword(s):

Session Types ◽

Pi Calculus

Download Full-text

Using session types for reasoning about boundedness in the $$\pi $$-calculus

Acta Informatica ◽

10.1007/s00236-019-00339-5 ◽

2019 ◽

Vol 57 (6) ◽

pp. 801-827

Author(s):

Hans Hüttel

Keyword(s):

Session Types ◽

Pi Calculus

Download Full-text

Bounded polymorphism in session types

Mathematical Structures in Computer Science ◽

10.1017/s0960129508006944 ◽

2008 ◽

Vol 18 (5) ◽

pp. 895-930 ◽

Cited By ~ 25

Author(s):

SIMON J. GAY

Keyword(s):

Operational Semantics ◽

Client Server ◽

Session Types ◽

Patterns Of Communication ◽

Pi Calculus ◽

Run Time ◽

High Level ◽

Communication Errors

Session types allow high-level specifications of structured patterns of communication, such as client-server protocols, to be expressed as types and verified by static typechecking. In collaboration with Malcolm Hole, we previously introduced a notion of subtyping for session types, which was formulated for an extended pi calculus. Subtyping allows one part of a system, for example, a server, to be refined without invalidating type-correctness of other parts, for example, clients. In this paper we introduce bounded polymorphism, which is based on the same notion of subtyping, in order to support more precise and flexible specifications of protocols; in particular, a choice of type in one message may affect the types of future messages. We formalise the syntax, operational semantics and typing rules of an extended pi calculus, and prove that typechecking guarantees the absence of run-time communication errors. We study algorithms for checking instances of the subtype relation in two versions of our system, which we call KernelS≤and FullS≤, and establish that subtyping in KernelS≤is decidable, and that subtyping in FullS≤is undecidable.

Download Full-text