Communication Dans Un Congrès Année : 2025

First-order store and visibility in name-passing calculi

Résumé

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.

Fichier principal
Vignette du fichier
main-online.pdf (312.04 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-05033251 , version 1 (23-04-2025)

Licence

Identifiants

Citer

Daniel Hirschkoff, Iwan Quémerais, Davide Sangiorgi. First-order store and visibility in name-passing calculi. 36th International Conference on Concurrency Theory (CONCUR 2025), Aug 2025, Aarhus (Denmark), Denmark. ⟨10.4230/LIPIcs⟩. ⟨hal-05033251⟩
232 Consultations
220 Téléchargements

Altmetric

Partager

  • More