Type Reconstruction for the Linear \pi-Calculus with Composite Regular Types
Luca Padovani (Universit\'a di Torino)

TL;DR
This paper introduces an extension to the linear pi-calculus with composite regular types, enabling shared linear data among processes without conflicts, along with a type reconstruction algorithm and implementation insights.
Contribution
It presents a novel extension of the linear pi-calculus with composite regular types and a type reconstruction algorithm for practical implementation.
Findings
The extended type system allows sharing of linear data without conflicts.
A type reconstruction algorithm is developed for the extended system.
Practical implementation aspects are discussed.
Abstract
We extend the linear {\pi}-calculus with composite regular types in such a way that data containing linear values can be shared among several processes, if there is no overlapping access to such values. We describe a type reconstruction algorithm for the extended type system and discuss some practical aspects of its implementation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
