Minimal session types for the π-calculus

IF 0.8 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Information and Computation Pub Date : 2024-01-26 DOI:10.1016/j.ic.2024.105148

Alen Arslanagić, Jorge A. Pérez, Anda-Amelia Palamariuc

{"title":"Minimal session types for the π-calculus","authors":"Alen Arslanagić, Jorge A. Pérez, Anda-Amelia Palamariuc","doi":"10.1016/j.ic.2024.105148","DOIUrl":null,"url":null,"abstract":"<div>Session types are a type-based approach to correct message-passing programs. A session type specifies a channel's protocol as sequences of exchanges. Aiming to uncover the essential notions of session-based concurrency, prior work defined minimal session types (MSTs), a formulation of session types without the sequentiality construct, and showed a minimality result: every process typable with standard session types can be transformed into a process typable using MSTs. Such a minimality result was proven for a higher-order session π-calculus, in which values are abstractions (functions from names to processes).In this paper, we study MSTs but now for the session π-calculus, the (first-order) language in which values are names and for which session types have been more widely studied. We first show that a new minimality result can be obtained by composing known results. Then, we develop optimizations of this new minimality result and prove also a dynamic correctness guarantee.</div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"297 ","pages":"Article 105148"},"PeriodicalIF":0.8000,"publicationDate":"2024-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0890540124000130/pdfft?md5=dca6052b3b897a7e1a5f44fb0794f9e3&pid=1-s2.0-S0890540124000130-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information and Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0890540124000130","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

Abstract

Session types are a type-based approach to correct message-passing programs. A session type specifies a channel's protocol as sequences of exchanges. Aiming to uncover the essential notions of session-based concurrency, prior work defined minimal session types (MSTs), a formulation of session types without the sequentiality construct, and showed a minimality result: every process typable with standard session types can be transformed into a process typable using MSTs. Such a minimality result was proven for a higher-order session π-calculus, in which values are abstractions (functions from names to processes).

In this paper, we study MSTs but now for the session π-calculus, the (first-order) language in which values are names and for which session types have been more widely studied. We first show that a new minimality result can be obtained by composing known results. Then, we develop optimizations of this new minimality result and prove also a dynamic correctness guarantee.

查看原文本刊更多论文

π微积分的最小会话类型

会话类型是静态验证消息传递程序的一门学科。会话类型将通道协议指定为交换序列。要研究基于会话的并发性，最重要的是确定能够进行程序规范和验证的基本概念。根据这一观点，先前的工作确定了最小会话类型（MST），它是会话类型的一个子类，没有顺序结构，指定了通信操作的结构。会话类型的这种表述方式导致建立了一个最小性结果：每个使用标准会话类型的可类型化进程都可以编译成一个使用 MST 的可类型化进程，MST 通过额外的进程同步来模拟类型中的顺序性。这样的最小性结果意义重大，因为它证明了会话类型本身的合理性，而无需借助外部概念；它是在高阶会话π演算中证明的，在高阶会话π演算中，值是抽象概念（从名称到进程的函数）。在本文中，我们将研究 MST 及其相关的最小性结果，但现在是针对会话π演算，即（一阶）语言，在这种语言中，值是名称，会话类型在这种语言中得到了更广泛的研究。我们首先证明，这一新的最小性结果可以通过组合已知结果获得。然后，我们对这一新的最小性结果进行了优化，并证明了将其转化为具有 MST 的过程的相关转换满足动态正确性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Information and Computation 工程技术-计算机：理论方法

CiteScore

2.30

自引率

0.00%

发文量

119

审稿时长

140 days

期刊介绍： Information and Computation welcomes original papers in all areas of theoretical computer science and computational applications of information theory. Survey articles of exceptional quality will also be considered. Particularly welcome are papers contributing new results in active theoretical areas such as -Biological computation and computational biology- Computational complexity- Computer theorem-proving- Concurrency and distributed process theory- Cryptographic theory- Data base theory- Decision problems in logic- Design and analysis of algorithms- Discrete optimization and mathematical programming- Inductive inference and learning theory- Logic & constraint programming- Program verification & model checking- Probabilistic & Quantum computation- Semantics of programming languages- Symbolic computation, lambda calculus, and rewriting systems- Types and typechecking