递归会话类型回顾
Recursive Session Types Revisited
摘要:
会话类型为基于通信的结构化编程建模。具体来说,π演算的二进制会话类型描述了分布式场景中两个参与者之间的通信。向pi演算添加会话意味着用类型和术语构造来扩充它。在之前的一篇文章中,我们试图理解会话结构在何种程度上比标准的pi演算结构更复杂和更具表达力。为此,我们采用线性类型和变量类型以及连续传递原则,提出了一种将二进制会话pi演算编码为标准类型pi演算的方法。在本文中,我们专注于递归会话类型,我们提出了一个编码到递归线性π演算。这种编码是前者的保守扩展,因为它保留了其中获得的结果。最重要的是,它采用了对偶关系的新处理方法,在递归类型的情况下,这已经被证明是相当具有挑战性的。
英文摘要:
Session types model structured communication-based programming. In particular, binary session types for the pi-calculus describe communication between exactly two participants in a distributed scenario. Adding sessions to the pi-calculus means augmenting it with type and term constructs. In a previous paper, we tried to understand to which extent the session constructs are more complex and expressive than the standard pi-calculus constructs. Thus, we presented an encoding of binary session pi-calculus to the standard typed pi-calculus by adopting linear and variant types and the continuation-passing principle. In the present paper, we focus on recursive session types and we present an encoding into recursive linear pi-calculus. This encoding is a conservative extension of the former in that it preserves the results therein obtained. Most importantly, it adopts a new treatment of the duality relation, which in the presence of recursive types has been proven to be quite challenging.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。