Linear type theory for asynchronous session types

Session types Support a type-theoretic formulation of structured patterns of communication, so that the communication behaviour of agents in a distributed system call be verified by static typechecking. Applications include network protocols, business processes and operating system services-In this paper we define a multithread functional language with session types, which unifies, simplifies and extends previous work. There are four main contributions. First is an operational semantics with buffered channels, instead of the synchronous communication of previous work. Second, we prove that the session type of a channel gives all upper bound on the necessary size of the buffer. Third, Session types are Manipulated by means of the standard structures Of a linear type theory, rather than by means of new forms of typing judgement. Fourth, a notion Of subtyping, including the standard subtyping relation for session types (imported into the functional setting), and a novel form of subtyping between standard and linear function types, which allows the typechecker to handle linear types conveniently. Our new approach significantly simplifies session types ill the functional setting clarifies their essential features and provides a secure foundation for language developments Such as polymorphism and object-orientation.