Answers are grounded in this paper and cite their sources.
Session types provide static guarantees that concurrent programs respect communication protocols. We give a novel account of recursive session types in the context of GV, a small concurrent extension of the linear λ-calculus. We extend GV with recursive types and catamorphisms, following the initial algebra semantics of recursion, and show that doing so naturally gives rise to recursive session types. We show that this principled approach to recursion resolves long-standing problems in the treatment of duality for recursive session types.
No takes yet. Share an insight, caveat, or question.
Lindley et al. (2016) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: