Global Principal Typing in Partially Commutative Asynchronous Sessions

  • Authors:
  • Dimitris Mostrous;Nobuko Yoshida;Kohei Honda

  • Affiliations:
  • Department of Computing, Imperial College London,;Department of Computing, Imperial College London,;Department of Computer Science, Queen Mary, University of London,

  • Venue:
  • ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We generalise a theory of multiparty session types for the *** -calculus through asynchronous communication subtyping, which allows partial commutativity of actions with maximal flexibility and safe optimisation in message choreography. A sound and complete algorithm for the subtyping relation, which can calculate conformance of optimised end-point processes to an agreed global specification, is presented. As a complementing result, we show a type inference algorithm for deriving the principal global specification from end-point processes which is minimal with respect to subtyping. The resulting theory allows a programmer to choose between a top-down and a bottom-up style of communication programming, ensuring the same desirable properties of typable processes.