Boreale, Michele and Buscemi, Maria Grazia and Montanari, Ugo A General Name Binding Mechanism. In: Proceedings of Symposium on Trustworthy Global Computing (TGC ’05). Lecture Notes in Computer Science, 3705 . Springer, pp. 61-74. ISBN 3-540-30007-4 (2005)Full text not available from this repository.
We study fusion and binding mechanisms in name passing process calculi. To this purpose, we introduce the U-Calculus, a process calculus with no I/O polarities and a unique form of binding. The latter can be used both to control the scope of fusions and to handle new name generation. This is achieved by means of a simple form of typing: each bound name x is annotated with a set of exceptions, that is names that cannot be fused to x. The new calculus is proven to be more expressive than pi-calculus and Fusion calculus separately. In U-Calculus, the syntactic nesting of name binders has a semantic meaning, which cannot be overcome by the ordering of name extrusions at runtime. Thanks to this mixture of static and dynamic ordering of names, U-Calculus admits a form of labelled bisimulation which is a congruence. This property yields a substantial improvement with respect to previous proposals by the same authors aimed at unifying the above two languages. The additional expressiveness of U-Calculus is also explored by providing a uniform encoding of mixed guarded choice into the choice-free sub-calculus.
|Item Type:||Book Section|
|Additional Information:||The final publication is available at www.springerlink.com.|
|Funders:||Research partially supported by IST FET Global projects PROFUNDIS IST-2001-33100 and MIKADO IST-2001-32222.|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Users 29 not found.|
|Date Deposited:||01 Mar 2011 08:48|
|Last Modified:||11 Jul 2011 14:33|
Actions (login required)