Parameterised Multiparty Session Types release_ajsbfrqz5bgnpagv5ud75xdszu

by Pierre-Malo Denielou, Nobuko Yoshida, Raymond Hu

Released as a article .

2012  

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\"odel's System T to express a wide range of communication patterns while keeping type checking decidable. To type individual distributed processes, a parameterised global type is projected onto a generic generator which represents a class of all possible end-point types. We prove the termination of the type-checking algorithm in the full system with both multiparty session types and recursive types. We illustrate our type theory through non-trivial programming and verification examples taken from parallel algorithms and Web services usecases.
In text/plain format

Archived Files and Locations

application/pdf  347.4 kB
file_z22xe74l7bchljy6wpbljxmeiy
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2012-08-31
Version   v1
Language   en ?
arXiv  1208.6483v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: ca6002e1-be22-4295-b4dd-645b6d1a03bd
API URL: JSON