3 papers
cs.LO2026
Mixed Choice Multiparty Session Types, Precisely
Jake Masters, Nobuko Yoshida
A precise (sound and complete) subtyping relation specifies that is a subtype of if and only if a program of type can always safely replace a program of type $…
math.LO2025
Logic of Sets with Atoms
Jake Masters
Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $…
cs.PL2025
Asynchronous Global Protocols, Precisely: Full Proofs
Kai Pischke, Jake Masters, Nobuko Yoshida
Asynchronous multiparty session types are a type-based framework which ensure the compatibility of components in a distributed system by checking compliance against a specified glo…