Multiparty Classical Choreographies

Abstract

We present Multiparty Classical Choreographies (MCC), a language model where global descriptions of communicating systems (choreographies) implement typed multiparty sessions. Typing is achieved by generalising classical linear logic to judgements that explicitly record parallelism by means of hypersequents. Our approach unifies different lines of work on choreographies and processes with multiparty sessions, as well as their connection to linear logic. Thus, results developed in one context are carried over to the others. Key novelties of MCC include support for server invocation in choreographies, as well as logic-driven compilation of choreographies with replicated processes. Prp = srv rp; rp(userrp); rp.case(rp(reprp); R1, Q1) Pip = srv ip; ip(loginip); ip(pwdip); R2 Ps = srv s; s(reps); s(acks); R3

Highly collaborative distributed systems: Synthesis and enactment at work

“…Carbone et al 49,50 exploit multiparty session types to automatically translate choreographies into local specifications of the communications that each endpoint should implement. Choreographic programming is a different approach prototyped by Montesi 51 and further developed in the recent years by his research group 52‐56 . The code for all endpoints is written in a single choreography, which instructs both communications and how data should be computed.…”

Choreographic Programming of Isolated Transactions

“…Choreographic programming originated with Carbone et al [7,8] (using binary session types [31]) and with Carbone and Montesi [10,37] (using multiparty session types [32]); substantial progress has been made since. Montesi and Yoshida developed a theory of compositional choreographic programming that supports open distributed systems [38]; Carbone et al studied connections between choreographic programming and linear logic [6,11]; Dalla Preda et al combined choreographic programming with dynamic adaptation [39][40][41]; Cruz-Filipe and Montesi developed a minimal Turing-complete language of global programs [21]; Cruz-Filipe et al and Kjaer et al presented techniques to extract global programs from families of local programs [17,35]; Giallorenzo et al studied a correspondence between choreographic programming and multitier languages [27]; Jongmans and Van den Bos combined choreographic programming with deductive verification [34]; Hirsch and Garg and Cruz-Filipe et al developed functional choreographic programming languages [16,30]. Other work includes results on case studies [18], procedural abstractions [20], asynchronous communication [19], polyadic communication [22,29], implementability [26], and formalisation/mechanisation in Coq [23,24,30].…”