Fair termination of binary sessions

A binary session is a private communication channel that connects two processes, each adhering to protocol description called type . In this work, we study the first system ensures fair termination of sessions. fairly terminates if all infinite executions admitted by its are deemed unrealistic because they violate certain fairness assumptions Fair entails eventual completion pending input/output actions, including those depend on an unbounded number other actions in possibly different This form lock freedom allows us address large family natural patterns fall outside scope existing systems. Our also adopt subtyping , liveness-preserving refinement standard relation for types so far has only been studied theoretically. surprisingly subtle not characterize concisely but use appropriately, point must carefully account usages avoid compromising properties.