{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T22:36:50Z","timestamp":1763764610235,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2012,10,11]],"date-time":"2012-10-11T00:00:00Z","timestamp":1349913600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"funder":[{"DOI":"10.13039\/100014013","name":"UK Research and Innovation","doi-asserted-by":"crossref","award":["EP\/F003757\/1"],"award-info":[{"award-number":["EP\/F003757\/1"]}],"id":[{"id":"10.13039\/100014013","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100014013","name":"UK Research and Innovation","doi-asserted-by":"crossref","award":["EP\/G015635\/1"],"award-info":[{"award-number":["EP\/G015635\/1"]}],"id":[{"id":"10.13039\/100014013","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>For many application-level distributed protocols and parallel algorithms, the\nset of participants, the number of messages or the interaction structure are\nonly known at run-time. This paper proposes a dependent type theory for\nmultiparty sessions which can statically guarantee type-safe, deadlock-free\nmultiparty interactions among processes whose specifications are parameterised\nby indices. We use the primitive recursion operator from G\\\"odel's System T to\nexpress a wide range of communication patterns while keeping type checking\ndecidable. To type individual distributed processes, a parameterised global\ntype is projected onto a generic generator which represents a class of all\npossible end-point types. We prove the termination of the type-checking\nalgorithm in the full system with both multiparty session types and recursive\ntypes. We illustrate our type theory through non-trivial programming and\nverification examples taken from parallel algorithms and Web services usecases.<\/jats:p>","DOI":"10.2168\/lmcs-8(4:6)2012","type":"journal-article","created":{"date-parts":[[2013,11,29]],"date-time":"2013-11-29T13:21:33Z","timestamp":1385731293000},"source":"Crossref","is-referenced-by-count":34,"title":["Parameterised Multiparty Session Types"],"prefix":"10.46298","volume":"Volume 8, Issue 4","author":[{"given":"Pierre-Malo","family":"Denielou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3925-8557","authenticated-orcid":false,"given":"Nobuko","family":"Yoshida","sequence":"additional","affiliation":[]},{"given":"Andi","family":"Bejleri","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4361-6772","authenticated-orcid":false,"given":"Raymond","family":"Hu","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2012,10,11]]},"reference":[{"key":"574:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/924\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/924\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T19:59:08Z","timestamp":1681243148000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/924"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,11]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-8(4:6)2012","relation":{"is-same-as":[{"id-type":"arxiv","id":"1208.6483","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1208.6483","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2012,10,11]]},"article-number":"924"}}