eprintid: 127
rev_number: 11
eprint_status: archive
userid: 29
dir: disk0/00/00/01/27
datestamp: 2011-03-01 08:48:14
lastmod: 2011-07-11 14:33:43
status_changed: 2011-03-01 09:25:40
type: book_section
metadata_visibility: show
item_issues_count: 0
creators_name: Boreale, Michele
creators_name: Buscemi, Maria Grazia
creators_name: Montanari, Ugo
creators_id: 
creators_id: m.buscemi@imtlucca.it
creators_id: 
title: A General Name Binding Mechanism
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
note: The final publication is available at www.springerlink.com.
abstract: 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.
date: 2005
date_type: published
series: Lecture Notes in Computer Science
volume: 3705
publisher: Springer
pagerange: 61-74
id_number: 10.1007/11580850_5
refereed: TRUE
isbn: 3-540-30007-4
book_title: Proceedings of Symposium on Trustworthy Global Computing (TGC ’05)
editors_name: De Nicola, Rocco
editors_name: Sangiorgi, Davide
official_url: http://dx.doi.org/10.1007/11580850_5
funders: Research partially supported by IST FET Global projects PROFUNDIS IST-2001-33100 and MIKADO IST-2001-32222.
citation:   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)