A generic type system for higher-order Ψ-calculi

被引：0

作者：

Huttel, Hans ^{[1
]}

Lybech, Stian ^{[2
]}

Bendixen, Alex R. ^{[3
]}

Bojesen, Bjarke B. ^{[3
]}

机构：

[1] Univ Copenhagen, Dept Comp Sci, Univ Pk 1, DK-2100 Copenhagen, Denmark

[2] Reykjavik Univ, Dept Comp Sci, Menntavegur 1, IS-102 Reykjavik, Iceland

[3] Aalborg Univ, Dept Comp Sci, Selma Lagerlofs Vej 300, DK-9220 Aalborg, Denmark

来源：

INFORMATION AND COMPUTATION | 2024年 / 300卷

关键词：

MOBILE PROCESSES;

D O I：

10.1016/j.ic.2024.105190

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The Higher-Order Psi-calculus framework (HO Psi) by Parrow et al. is a generalisation of many first- and higher-order extensions of the pi-calculus. In this paper we present a generic type system for HO Psi-calculi. It satisfies a subject reduction property and can be instantiated to yield both existing and new type systems for calculi, that can be expressed as HO Psi-calculi. In this paper, we consider the type system for termination in HO pi by Demangeon et al. Moreover, we derive a new type system for the rho-calculus of Meredith and Radestock and present a type system for non-interference for mobile code. (c) 2024 The Authors. Published by Elsevier Inc. This is an open access article under the CC BY license (http://creativecommons .org /licenses /by /4 .0/).

引用

页数：26

共 50 条

[11] On the expressiveness and decidability of higher-order process calculi
Lanese, Ivan
Perez, Jorge A.
Sangiorgi, Davide
Schmitt, Alan
INFORMATION AND COMPUTATION, 2011, 209 (02) : 198 - 226
[12] On the expressiveness and decidability of higher-order process calculi
Lanese, Ivan
Perez, Jorge A.
Sangiorgi, Davide
Schmitt, Alan
TWENTY-THIRD ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2008, : 145 - +
[13] A normalisation result for higher-order calculi with explicit substitutions
Bonelli, E
FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2003, 2620 : 153 - 168
[14] Towards a theory of bisimulation for the higher-order process calculi
Yong-Jian Li
Xin-Xin Liu
Journal of Computer Science and Technology, 2004, 19 : 352 - 363
[15] Rewriting calculi, higher-order reductions and patterns:: introduction
Cirstea, Horatiu
Fernandez, Maribel
MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2008, 18 (03) : 427 - 429
[16] Contextual Labelled Semantics for Higher-order Process Calculi
Li, Yongjian
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 138 (01) : 61 - 77
[17] Towards a theory of bisimulation for the higher-order process calculi
Li, YJ
Liu, XX
JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2004, 19 (03) : 352 - 363
[18] Higher-order Lagrangian equations of higher-order motive mechanical system
Zhao Hong-Xia
Ma Shan-Jun
Shi Yong
COMMUNICATIONS IN THEORETICAL PHYSICS, 2008, 49 (02) : 479 - 481
[19] Higher-Order Lagrangian Equations of Higher-Order Motive Mechanical System
ZHAO Hong-Xia MA Shan-Jun SHI Yong College of Physics and Communication Electronics
Communications in Theoretical Physics, 2008, 49 (02) : 479 - 481
[20] Asynchronous process calculi: the first- and higher-order paradigms
Sangiorgi, D
THEORETICAL COMPUTER SCIENCE, 2001, 253 (02) : 311 - 350

← 1 2 3 4 5 →