Acta Informatica

, Volume 42, Issue 2–3, pp 191–225

Subtyping for session types in the pi calculus

Original Article

DOI: 10.1007/s00236-005-0177-z

Cite this article as:
Gay, S. & Hole, M. Acta Informatica (2005) 42: 191. doi:10.1007/s00236-005-0177-z

Abstract

Extending the pi calculus with the session types proposed by Honda et al. allows high-level specifications of structured patterns of communication, such as client-server protocols, to be expressed as types and verified by static typechecking. We define a notion of subtyping for session types, which allows protocol specifications to be extended in order to describe richer behaviour; for example, an implemented server can be refined without invalidating type-correctness of an overall system. We formalize the syntax, operational semantics and typing rules of an extended pi calculus, prove that typability guarantees absence of run-time communication errors, and show that the typing rules can be transformed into a practical typechecking algorithm.

Copyright information

© Springer-Verlag 2005

Authors and Affiliations

  1. 1.Department of Computing ScienceUniversity of GlasgowUK
  2. 2.Department of Computer Science, Royal HollowayUniversity of LondonUK

Personalised recommendations