2026-07-20T05:07:07Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:23973 2025-11-12T13:25:11Z ddc:004 open_access

First-Order Store and Visibility in Name-Passing Calculi Hirschkoff, Daniel Quémerais, Iwan Sangiorgi, Davide process calculi behavioural equivalence type system The π-calculus is the paradigmatical name-passing calculus. While being purely name-passing, it allows the representation of higher-order functions and store. We study how π-calculus processes can be controlled so that computations can only involve storage of first-order values. The discipline is enforced by a type system that is based on the notion of visibility, coming from game semantics. We discuss the impact of visibility on the behavioural theory. We propose characterisations of may-testing and barbed equivalence, based on (variants of) trace equivalence and labelled bisimilarity, in the case where computation is sequential, and in the case where computation is well-bracketed. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Daniel Hirschkoff and Iwan Quémerais and Davide Sangiorgi 2025 Is Part Of LIPIcs, Volume 348, 36th International Conference on Concurrency Theory (CONCUR 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CONCUR.2025.23 urn:nbn:de:0030-drops-239737 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2025.23 eng https://creativecommons.org/licenses/by/4.0/legalcode