Write a Blog >>
ICFP 2016
Sun 18 - Sat 24 September 2016 Nara, Japan
Wed 21 Sep 2016 15:05 - 15:30 at Noh Theater - Session 11 Chair(s): Alejandro Russo

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.

We characterize the expressiveness of GV concurrency by giving a CPS translation to (non-concurrent) λ-calculus and proving that reduction in GV is simulated by full reduction in λ-calculus. This shows that GV remains terminating in the presence of positive recursive types, and that such arguments extend to other extensions of GV, such as polymorphism or non-linear types, by appeal to normalization results for sequential λ-calculi. We also show that GV remains deadlock free and deterministic in the presence of recursive types.

Finally, we extend CP, a session-typed process calculus based on linear logic, with recursive types, and show that doing so preserves the connection between reduction in GV and cut elimination in CP.

Wed 21 Sep

15:05 - 16:20: Research Papers - Session 11 at Noh Theater
Chair(s): Alejandro RussoChalmers University of Technology
icfp-2016-papers15:05 - 15:30
Sam LindleyUniversity of Edinburgh, UK, J. Garrett MorrisUniversity of Edinburgh, UK
icfp-2016-papers15:30 - 15:55
J. Garrett MorrisUniversity of Edinburgh, UK
icfp-2016-papers15:55 - 16:20
Peter ThiemannUniversity of Freiburg, Germany, Vasco Thudichum Vasconcelos