Mixed Choice Multiparty Session Types, Precisely

Jake Masters, Nobuko Yoshida

A precise (sound and complete) subtyping relation $\le$ specifies that $T^{\prime }$ is a subtype of $T$ if and only if a program of type $T^{\prime }$ can always safely replace a program of type $…