Type Reconstruction for the Linear \pi-Calculus with Composite Regular Types
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 practic...
Main Author: | Luca Padovani |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2015-12-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/1614/pdf |
Similar Items
-
Contextual equivalence for higher-order pi-calculus revisited
by: Alan Jeffrey, et al.
Published: (2005-04-01) -
Privacy by typing in the $\pi$-calculus
by: Dimitrios Kouzapas, et al.
Published: (2017-12-01) -
Resource Usage Analysis for the Pi-Calculus
by: Naoki Kobayashi, et al.
Published: (2006-09-01) -
The Guarded Lambda-Calculus: Programming and Reasoning with Guarded Recursion for Coinductive Types
by: Ranald Clouston, et al.
Published: (2017-04-01) -
LNL-FPC: The Linear/Non-linear Fixpoint Calculus
by: Bert Lindenhovius, et al.
Published: (2021-04-01)