Hans Hüttel , Stian Lybech , Alex R. Bendixen , Bjarke B. Bojesen
{"title":"A generic type system for higher-order Ψ-calculi","authors":"Hans Hüttel , Stian Lybech , Alex R. Bendixen , Bjarke B. Bojesen","doi":"10.1016/j.ic.2024.105190","DOIUrl":null,"url":null,"abstract":"<div><p>The Higher-Order Ψ-calculus framework (HOΨ) by Parrow et al. is a generalisation of many first- and higher-order extensions of the <em>π</em>-calculus. In this paper we present a generic type system for HOΨ-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Ψ-calculi. In this paper, we consider the type system for termination in HO<em>π</em> by Demangeon et al. Moreover, we derive a new type system for the <em>ρ</em>-calculus of Meredith and Radestock and present a type system for non-interference for mobile code.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"300 ","pages":"Article 105190"},"PeriodicalIF":0.8000,"publicationDate":"2024-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0890540124000555/pdfft?md5=5e7315b62a66845496d085f24a5451e4&pid=1-s2.0-S0890540124000555-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information and Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0890540124000555","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
The Higher-Order Ψ-calculus framework (HOΨ) by Parrow et al. is a generalisation of many first- and higher-order extensions of the π-calculus. In this paper we present a generic type system for HOΨ-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Ψ-calculi. In this paper, we consider the type system for termination in HOπ by Demangeon et al. Moreover, we derive a new type system for the ρ-calculus of Meredith and Radestock and present a type system for non-interference for mobile code.
期刊介绍：
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
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
