Talking bananas: Structural recursion for session types

S. Lindley, J. Garrett Morris

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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. © 2016 ACM.
Original languageEnglish
Title of host publicationICFP 2016: Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming
PublisherAssociation for Computing Machinery
Pages434-447
Number of pages14
ISBN (Print)9781450342193
DOIs
Publication statusPublished - Sep 2016

Keywords

  • recursion
  • Session types
  • Biomineralization
  • Differentiation (calculus)
  • Semantics
  • Concurrent program
  • Cut elimination
  • Initial algebras
  • Lambda calculus
  • Linear lambda calculus
  • Process calculi
  • Standing problems
  • Structural recursion
  • Calculations

Fingerprint Dive into the research topics of 'Talking bananas: Structural recursion for session types'. Together they form a unique fingerprint.

  • Cite this

    Lindley, S., & Garrett Morris, J. (2016). Talking bananas: Structural recursion for session types. In ICFP 2016: Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming (pp. 434-447). Association for Computing Machinery. https://doi.org/10.1145/2951913.2951921