当前位置: X-MOL 学术arXiv.cs.LO › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Session Coalgebras: A Coalgebraic View on Session Types and Communication Protocols
arXiv - CS - Logic in Computer Science Pub Date : 2020-11-11 , DOI: arxiv-2011.05712
Alex C. Keizer, Henning Basold, Jorge A. P\'erez

Compositional methods are central to the development and verification of software systems. They allow to break down large systems into smaller components, while enabling reasoning about the behaviour of the composed system. For concurrent and communicating systems, compositional techniques based on behavioural type systems have received much attention. By abstracting communication protocols as types, these type systems can statically check that programs interact with channels according to a certain protocol, whether the intended messages are exchanged in a certain order. In this paper, we put on our coalgebraic spectacles to investigate session types, a widely studied class of behavioural type systems. We provide a syntax-free description of session-based concurrency as states of coalgebras. As a result, we rediscover type equivalence, duality, and subtyping relations in terms of canonical coinductive presentations. In turn, this coinductive presentation makes it possible to elegantly derive a decidable type system with subtyping for $\pi$-calculus processes, in which the states of a coalgebra will serve as channel protocols. Going full circle, we exhibit a coalgebra structure on an existing session type system, and show that the relations and type system resulting from our coalgebraic perspective agree with the existing ones.

中文翻译:

Session Coalgebras:关于会话类型和通信协议的 Coalgebraic 视图

组合方法是软件系统开发和验证的核心。它们允许将大型系统分解为更小的组件,同时能够对组合系统的行为进行推理。对于并发和通信系统,基于行为类型系统的组合技术备受关注。通过将通信协议抽象为类型,这些类型系统可以静态地检查程序是否按照某种协议与通道交互,是否按某种顺序交换了预期的消息。在本文中,我们戴上我们的代数眼镜来研究会话类型,这是一种广泛研究的行为类型系统。我们提供了基于会话的并发性的无语法描述,作为代数的状态。结果,我们重新发现了类型等价性、二元性,和根据规范共归纳表示的子类型关系。反过来,这种共归纳表示可以优雅地推导出具有子类型的可判定类型系统,用于 $\pi$-calculus 过程,其中代数的状态将用作通道协议。完整循环,我们在现有的会话类型系统上展示了一个合代数结构,并表明我们的合代数视角产生的关系和类型系统与现有的一致。
更新日期:2020-11-12
down
wechat
bug