On deep combine for binary probabilistic session types
Marco Carbone · ITU
Abstract to follow. The talk also introduces the work of Inverso et al. on probabilistic binary session types.
Workshop · IT University of Copenhagen · 15–16 September 2026
A small, informal workshop bringing together researchers working on probabilistic extensions of session types and related behavioural type theories. The format alternates talks with discussions and working groups, with the second day devoted to open problems and possible joint funding applications.
Marco Carbone · ITU
Abstract to follow. The talk also introduces the work of Inverso et al. on probabilistic binary session types.
Aleksander Junge · University of Oxford
We exhibit a probabilistic multiparty session calculus, as well as an accompanying MPST type system. The type system follows the bottom-up approach of checking safety and liveness by model checking: we export the composition of individual local types of the session into PRISM modules and model check their interleaving. The type system takes safety to be the only required ‘sure’ property and permits ‘partial correctness’ on deadlock-freedom and liveness, i.e. the model checking simply returns lower bounds for the probability with which these properties hold. The talk focuses on implementation aspects such as type inference and PRISM property encodings, in particular liveness, which took some work to get right, as PRISM’s notion of fairness was too crude to utilize directly.
Maria Bendix Mikkelsen · ITU
Session types can be extended with probabilities, so that a protocol says not only who sends what to whom, but how likely each branch is. One thing a type can then compute is the probability that the protocol succeeds. Inverso et al. do this for binary sessions, typing a probabilistic choice by combining two typing contexts. We report on carrying this to the multiparty setting, typing processes directly against global types rather than projecting to local types. Here, a participant that takes no part in a communication cannot see which way it went. The weights it sees afterwards are marginals over the branches, and observing them tells it something about which branch was taken. So the probabilities depend on who is looking, and the design question is what a global type should record. We describe two approaches: 1. computing the marginal, by erasing the communications a participant cannot see and combining the remaining branches, and 2. storing both branches in a constructor that is never simplified. The first leaves types as protocols in the ordinary sense, but makes the metatheory hard, for reasons we will state. The second treats types as mixtures of protocols instead, and is mechanised in Rocq. Recursion is current work.
Kirstin Peters · University of Augsburg
Abstract to follow.
Alceste Scalas · DTU
Abstract to follow. The talk is based on doi.org/10.1007/978-3-030-78142-2_7 and doi.org/10.1016/j.scico.2022.102847.
Litu Zou · University of Oxford
Session types are behavioural types whose states evolve through communication between processes. When randomness or uncertainty is present, conventional session typing—based primarily on communication structure—does not provide sufficient semantic compositionality. A richer, semantics-based approach is needed to verify both totally and partially correct processes. This talk presents a methodology for integrating probabilistic bisimulation into a probabilistic multiparty session type system.
The workshop takes place in room 3A20 at the IT University of Copenhagen, Rued Langgaards Vej 7, 2300 Copenhagen S (map).
On arrival, please check in at the ITU reception: the staff there will tell you how to find the room.