Parameterised Multiparty Session Types

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¨odel’s System 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.

• Type: Conference
• Year: 2010
• Where: FOSSACS
• Authors: Nobuko Yoshida, Pierre-Malo Deniélou, Andi Bejleri, Raymond Hu
• Keywords: Application-level Distributed Protocols, Applied Computing, FOSSACS 2010, Parallel Algorithms, Type Theory