{"title":"比较源自线性逻辑的会话类型系统","authors":"Bas van den Heuvel , Jorge A. Pérez","doi":"10.1016/j.jlamp.2024.101004","DOIUrl":null,"url":null,"abstract":"<div><p><em>Session types</em> are a typed approach to message-passing concurrency, where types describe sequences of intended exchanges over channels. Session type systems have been given strong logical foundations via Curry-Howard correspondences with <em>linear logic</em>, a resource-aware logic that naturally captures structured interactions. These logical foundations provide an elegant framework to specify and (statically) verify message-passing processes.</p><p>In this paper, we rigorously compare different type systems for concurrency derived from the Curry-Howard correspondence between linear logic and session types. We address the main divide between these type systems: the classical and intuitionistic presentations of linear logic. Over the years, these presentations have given rise to separate research strands on logical foundations for concurrency; the differences between their derived type systems have only been addressed informally.</p><p>To formally assess these differences, we develop <span><math><mi>π</mi><mrow><mi>ULL</mi></mrow></math></span>, a session type system that encompasses type systems derived from classical and intuitionistic interpretations of linear logic. Based on a fragment of Girard's Logic of Unity, <span><math><mi>π</mi><mrow><mi>ULL</mi></mrow></math></span> provides a basic reference framework: we compare existing session type systems by characterizing fragments of <span><math><mi>π</mi><mrow><mi>ULL</mi></mrow></math></span> that coincide with classical and intuitionistic formulations. We analyze the significance of our characterizations by considering the <em>locality</em> principle (enforced by intuitionistic interpretations but not by classical ones) and forms of <em>process composition</em> induced by the interpretations.</p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"142 ","pages":"Article 101004"},"PeriodicalIF":0.7000,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352220824000580/pdfft?md5=294ab7a9dfc6c75e24cca0d439232106&pid=1-s2.0-S2352220824000580-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Comparing session type systems derived from linear logic\",\"authors\":\"Bas van den Heuvel , Jorge A. Pérez\",\"doi\":\"10.1016/j.jlamp.2024.101004\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p><em>Session types</em> are a typed approach to message-passing concurrency, where types describe sequences of intended exchanges over channels. Session type systems have been given strong logical foundations via Curry-Howard correspondences with <em>linear logic</em>, a resource-aware logic that naturally captures structured interactions. These logical foundations provide an elegant framework to specify and (statically) verify message-passing processes.</p><p>In this paper, we rigorously compare different type systems for concurrency derived from the Curry-Howard correspondence between linear logic and session types. We address the main divide between these type systems: the classical and intuitionistic presentations of linear logic. Over the years, these presentations have given rise to separate research strands on logical foundations for concurrency; the differences between their derived type systems have only been addressed informally.</p><p>To formally assess these differences, we develop <span><math><mi>π</mi><mrow><mi>ULL</mi></mrow></math></span>, a session type system that encompasses type systems derived from classical and intuitionistic interpretations of linear logic. Based on a fragment of Girard's Logic of Unity, <span><math><mi>π</mi><mrow><mi>ULL</mi></mrow></math></span> provides a basic reference framework: we compare existing session type systems by characterizing fragments of <span><math><mi>π</mi><mrow><mi>ULL</mi></mrow></math></span> that coincide with classical and intuitionistic formulations. We analyze the significance of our characterizations by considering the <em>locality</em> principle (enforced by intuitionistic interpretations but not by classical ones) and forms of <em>process composition</em> induced by the interpretations.</p></div>\",\"PeriodicalId\":48797,\"journal\":{\"name\":\"Journal of Logical and Algebraic Methods in Programming\",\"volume\":\"142 \",\"pages\":\"Article 101004\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2024-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S2352220824000580/pdfft?md5=294ab7a9dfc6c75e24cca0d439232106&pid=1-s2.0-S2352220824000580-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Logical and Algebraic Methods in Programming\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2352220824000580\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Logical and Algebraic Methods in Programming","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2352220824000580","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
摘要
会话类型是一种消息传递并发的类型化方法,其中的类型描述了在通道上的预期交换序列。会话类型系统通过与线性逻辑的库里-霍华德对应关系获得了坚实的逻辑基础,线性逻辑是一种资源感知逻辑,能自然地捕捉结构化的交互。这些逻辑基础为指定和(静态)验证消息传递过程提供了一个优雅的框架。在本文中,我们严格比较了从线性逻辑和会话类型之间的 Curry-Howard 对应关系中衍生出来的不同并发类型系统。我们讨论了这些类型系统之间的主要分歧:线性逻辑的经典表述和直觉表述。为了正式评估这些差异,我们开发了会话类型系统 πULL,它包含了从线性逻辑的经典解释和直觉解释中派生出来的类型系统。πULL以吉拉德的《统一逻辑》(Logic of Unity)的一个片段为基础,提供了一个基本的参考框架:我们通过描述πULL中与经典和直觉主义表述相吻合的片段来比较现有的会话类型系统。我们通过考虑局部性原则(直观解释强制执行,而经典解释不强制执行)和解释所诱导的流程组成形式,来分析我们的特征描述的意义。
Comparing session type systems derived from linear logic
Session types are a typed approach to message-passing concurrency, where types describe sequences of intended exchanges over channels. Session type systems have been given strong logical foundations via Curry-Howard correspondences with linear logic, a resource-aware logic that naturally captures structured interactions. These logical foundations provide an elegant framework to specify and (statically) verify message-passing processes.
In this paper, we rigorously compare different type systems for concurrency derived from the Curry-Howard correspondence between linear logic and session types. We address the main divide between these type systems: the classical and intuitionistic presentations of linear logic. Over the years, these presentations have given rise to separate research strands on logical foundations for concurrency; the differences between their derived type systems have only been addressed informally.
To formally assess these differences, we develop , a session type system that encompasses type systems derived from classical and intuitionistic interpretations of linear logic. Based on a fragment of Girard's Logic of Unity, provides a basic reference framework: we compare existing session type systems by characterizing fragments of that coincide with classical and intuitionistic formulations. We analyze the significance of our characterizations by considering the locality principle (enforced by intuitionistic interpretations but not by classical ones) and forms of process composition induced by the interpretations.
期刊介绍:
The Journal of Logical and Algebraic Methods in Programming is an international journal whose aim is to publish high quality, original research papers, survey and review articles, tutorial expositions, and historical studies in the areas of logical and algebraic methods and techniques for guaranteeing correctness and performability of programs and in general of computing systems. All aspects will be covered, especially theory and foundations, implementation issues, and applications involving novel ideas.