Parameterised multiparty session types

  • Authors:
  • Nobuko Yoshida;Pierre-Malo Deniélou;Andi Bejleri;Raymond Hu

  • Affiliations:
  • Department of Computing, Imperial College, London;Department of Computing, Imperial College, London;Department of Computing, Imperial College, London;Department of Computing, Imperial College, London

  • Venue:
  • FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

For many application-level distributed protocols and parallel algorithms, the set of participants, the number of messages or the interaction structure are only known at run-time. This paper proposes a dependent type theory for multiparty sessions which can statically guarantee type-safe, deadlock-free multiparty interactions among processes whose specifications are parameterised by indices. We use the primitive recursion operator from Gödel's System $\mathcal T$ to express a wide range of communication patterns while keeping type checking decidable. We illustrate our type theory through non-trivial programming and verification examples taken from parallel algorithms and Web services usecases.