We investigate how different fairness assumptions affect results concerning lock-freedom, a typical liveness property targeted by session type systems. We fix a minimal session calculus and systematically take into account all known fairness assumptions, thereby identifying precisely three interesting and semantically distinct notions of lock-freedom, all of which having a sound session type system. We then show that, by using a general merge operator in an otherwise standard approach to global session types, we obtain a session type system complete for the strongest amongst those notions of lock-freedom, which assumes only justness of execution paths, a minimal fairness assumption for concurrent systems.

翻译：我们调查不同的公平假设如何影响关于锁定自由(一种典型的会话类型系统针对的典型生活财产)的结果;我们确定一个最低限度的会话计算,并系统地考虑到所有已知的公平假设,从而精确地确定三个有趣的、言语上截然不同的锁定自由概念,所有这些概念都有一个健全的会话类型系统;然后我们表明,通过使用一个通用的合并操作器来对全球会话类型采用另一种标准的方法,我们获得了一个最强的会话类型系统,这些自由概念只假定执行路线的公正,而同时使用的系统则是最低限度的公平假设。