Graph Types for Monadic Mobile Processes
Graph Types for Monadic Mobile Processes
复制标题
Monadic 移动流程的图形类型
DOI：
10.1007/3-540-62034-6_64
复制
发表时间：
1996
期刊：
影响因子：
--
通讯作者：
N. Yoshida
中科院分区：
文献类型：
--
作者：
N. Yoshida
虽然已经在多源π-calculus分类的背景下进行了广泛的研究，但已广泛研究了calculi [5，34，9，28，32，19，33，33，10，17]，但在Monadic中不可能进行相同类型的抽象设置是米尔纳（Milner）作为一个开放的问题[21]。在且只有当它们的编码在类型的单声学计算中的基本行为平等中时，当多核π-terms的编码中的多源性π-calculus在多核计算中的基本行为平等是相等的我们在多核名称传递的背景下知道的第一个结果，这是将高级通信结构转换为π-calculus的典型示例一般足以扩展到具有更复杂的操作结构的微积分的编码。
While types for name passing calculi have been studied extensively in the context of sorting of polyadic π-calculus [5, 34, 9, 28, 32, 19, 33, 10, 17], the same type abstraction is not possible in the monadic setting, which was left as an open issue by Milner [21]. We solve this problem with an extension of sorting which captures dynamic aspects of process behaviour in a simple way. Equationally this results in the full abstraction of the standard encoding of polyadic π-calculus into the monadic one: the sorted polyadic π-terms are equated by a basic behavioural equality in the polyadic calculus if and only if their encodings are equated in a basic behavioural equality in the typed monadic calculus. This is the first result of this kind we know of in the context of the encoding of polyadic name passing, which is a typical example of translation of high-level communication structures into π-calculus. The construction is general enough to be extendable to encodings of calculi with more complex operational structures.