This paper presents the Kell calculus, a new distributed process calculus that retains the original insights of the Seal calculus (local actions, process replication) and of the M-calculus (higher-order processes and programmable membranes), although in a much simpler setting than the latter. The calculus is equipped with a type system that enforces a unicity property for location names that is crucial for the efficient implementation of the calculus. © IFIP International Federation for Information Processing 2003.
CITATION STYLE
Bidinger, P., & Stefani, J. B. (2003). The Kell calculus: Operational semantics and type system. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2884, 109–123. https://doi.org/10.1007/978-3-540-39958-2_8
Mendeley helps you to discover research relevant for your work.