Talking bananas: structural recursion for session types

DOI10.1145/2951913.2951921zbMath1360.68334OpenAlexW2517371102MaRDI QIDQ2985793

J. Garrett Morris, Sam Lindley

Publication date: 10 May 2017

Published in: Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/26557604/talking_bananas.pdf

zbMATH Keywords

recursionsession types

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (19)

Mixed Sessions ⋮ Multiparty session types, beyond duality ⋮ Comparing type systems for deadlock freedom ⋮ Unnamed Item ⋮ Separating Sessions Smoothly ⋮ The different shades of infinite session types ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Observed Communication Semantics for Classical Processes ⋮ Unnamed Item ⋮ Nested session types ⋮ Session coalgebras: a coalgebraic view on session types and communication protocols ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Mixed sessions ⋮ Session Types with Arithmetic Refinements ⋮ Unnamed Item ⋮ Prioritise the best variation

This page was built for publication: Talking bananas: structural recursion for session types