Partially Typed Multiparty Sessions

A multiparty session formalises a set of concurrent communicating participants. We propose a type system for multiparty sessions where some communications between participants can be ignored. This allows us to type some sessions with global types representing interesting protocols, which have no type in the standard type systems. Our type system enjoys Subject Reduction, Session Fidelity and"partial"Lock-freedom. The last property ensures the absence of locks for participants with non ignored communications. A sound and complete type inference algorithm is also discussed.

[1]  L. Padovani,et al.  Fair Termination of Multiparty Sessions , 2022, ECOOP.

[2]  M. Dezani-Ciancaglini,et al.  Asynchronous Sessions with Input Races , 2022, PLACES@ETAPS.

[3]  Mariangiola Dezani-Ciancaglini,et al.  Deconfined Global Types for Asynchronous Sessions , 2021, COORDINATION.

[4]  Ross Horne,et al.  Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom , 2021, 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[5]  Ivan Lanese,et al.  Composition and decomposition of multiparty sessions , 2021, J. Log. Algebraic Methods Program..

[6]  Ross Horne,et al.  Global types with internal delegation , 2020, Theor. Comput. Sci..

[7]  Ilaria Castellani,et al.  Reversible sessions with flexible choices , 2019, Acta Informatica.

[8]  Paula Severi,et al.  Observational Equivalence for Multiparty Sessions , 2019, Fundam. Informaticae.

[9]  Nobuko Yoshida,et al.  Explicit Connection Actions in Multiparty Session Types , 2017, FASE.

[10]  Mario Bravetti,et al.  Undecidability of asynchronous session subtyping , 2016, Inf. Comput..

[11]  Bernardo Toninho,et al.  Fencing off go: liveness and safety for channel-based programming , 2016, POPL.

[12]  Nobuko Yoshida,et al.  Multiparty asynchronous session types , 2008, POPL '08.

[13]  Alexandra Silva,et al.  Practical coinduction , 2016, Mathematical Structures in Computer Science.

[14]  Emilio Tuosto,et al.  From Communicating Machines to Graphical Choreographies , 2015, POPL.

[15]  Luca Padovani,et al.  Deadlock and lock freedom in the linear π-calculus , 2014, CSL-LICS.

[16]  A. Støylen.  [Is this enough?]. , 2013, Tidsskrift for den Norske laegeforening : tidsskrift for praktisk medicin, ny raekke.

[17]  Romain Demangeon,et al.  Nested Protocols in Session Types , 2012, CONCUR.

[18]  Nobuko Yoshida,et al.  Global Principal Typing in Partially Commutative Asynchronous Sessions , 2009, ESOP.

[19]  Davide Sangiorgi,et al.  A hybrid type system for lock-freedom of mobile processes , 2008, TOPL.

[20]  Luca Padovani,et al.  A theory of contracts for Web services , 2007, TOPL.

[21]  Gopal Gupta,et al.  Co-Logic Programming: Extending Logic Programming with Coinduction , 2007, ICALP.

[22]  Jirí Adámek,et al.  Iterative algebras at work , 2006, Mathematical Structures in Computer Science.

[23]  Gopal Gupta,et al.  Coinductive Logic Programming , 2006, ICLP.

[24]  Naoki Kobayashi,et al.  A Type System for Lock-Free Processes , 2002, Inf. Comput..

[25]  Bruno Courcelle,et al.  Fundamental Properties of Infinite Trees , 1983, Theor. Comput. Sci..

[26]  E. Tuosto,et al.  Formal Choreographic Languages , 2022, COORDINATION.

[27]  Davide Ancona,et al.  A Theoretical Perspective of Coinductive Logic Programming , 2015, Fundam. Informaticae.

[28]  G. Gupta,et al.  Extending logic programming with coinduction , 2006 .

[29]  Benjamin C. Pierce,et al.  Types and programming languages: the next generation , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..