The Name-Passing Calculus
read the original abstract
Name-passing calculi are foundational models for mobile computing. Research into these models has produced a wealth of results ranging from relative expressiveness to programming pragmatics. The diversity of these results call for clarification and reorganization. This paper applies a model independent approach to the study of the name-passing calculi, leading to a uniform treatment and simplification. The technical tools and the results presented in the paper form the foundation for a theory of name-passing calculus.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
A Unifying Approach to Probabilistic Testing Equivalences
A unifying framework for probabilistic testing equivalences is introduced via distribution-based semantics and process predicates, yielding internal and external characterizations that generalize classical fair/should...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.