Session types revisited

Session types revisited
复制标题

重新审视会话类型

DOI:
10.1145/2370776.2370794
复制
发表时间:
2012
影响因子:
0.5
通讯作者:
D. Sangiorgi
D. Sangiorgi
中科院分区:
计算机科学4区
文献类型:
--
作者:
Ornela Dardha;Elena Giachino;D. Sangiorgi

文献摘要

参考文献

被引文献

相似文献

会话类型是对基于结构化通信的编程进行建模的形式主义。会话类型通过指定双方之间交换的数据的类型和方向来描述通信。当会话类型和会话原语被添加到标准π演算类型和术语的语法中时,它们会产生额外的单独的句法类别。因此,当添加新的类型特征时,理论中存在重复的努力:必须在普通类型和会话类型上检查性质的证明。我们证明了会话类型可以编码为普通的π类型,依赖于线性类型和变量类型。除了作为表现力的结果之外,编码(I)去除了语法中的上述冗余,以及(Ii)会话类型的属性被作为直接的推论导出,利用了普通π类型的相应属性。编码的健壮性在几个会话类型的扩展上进行了测试,包括子类型、多态和更高级别的通信。
Session types are a formalism to model structured communication-based programming. A session type describes communication by specifying the type and direction of data exchanged between two parties. When session types and session primitives are added to the syntax of standard π-calculus types and terms, they give rise to additional separate syntactic categories. As a consequence, when new type features are added, there is duplication of efforts in the theory: the proofs of properties must be checked both on ordinary types and on session types. We show that session types are encodable in ordinary π types, relying on linear and variant types. Besides being an expressivity result, the encoding (i) removes the above redundancies in the syntax, and (ii) the properties of session types are derived as straightforward corollaries, exploiting the corresponding properties of ordinary π types. The robustness of the encoding is tested on a few extensions of session types, including subtyping, polymorphism and higher-order communications.
会话类型作为通用流程类型
DOI: --
发表时间: 2008
期刊: --
影响因子: --
作者:
N/a Gay
通讯作者: N/a Gay