Construction and analysis of distributed systems is difficult. Multiparty session types (MPST) constitute a method to make it easier. The idea is to use type checking to statically prove deadlock freedom and protocol compliance of communicating processes. In practice, the premier approach to apply the MPST method in combination with mainstream programming languages has been based on API generation. In this paper (pearl), we revisit and revise this approach. Regarding our “revisitation”, using Scala 3, we present the existing API generation approach, which is based on deterministic finite automata (DFA), in terms of both the existing states-as-classes encoding of DFAs as APIs, and a new states-as-type-parameters encoding; the latter leverages match types in Scala 3. Regarding our “revision”, also using Scala 3, we present a new API generation approach that is based on sets of pomsets instead of DFAs; it crucially leverages match types, too. Our fresh perspective allows us to avoid two forms of combinatorial explosion resulting from implementing concurrent subprotocols in the DFA-based approach. We implement our approach in a new API generation tool.

, , ,
36th European Conference on Object-Oriented Programming, ECOOP 2022
Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands

Cledou, G, Edixhoven, L.J, Jongmans, S.-S.T.Q, & Proença, J.M.P. (2022). API generation for multiparty session types, revisited and revised using Scala 3. In Leibniz International Proceedings in Informatics, LIPIcs. doi:10.4230/LIPIcs.ECOOP.2022.27