Abstract | ||
---|---|---|
This paper(1) 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. |
Year | DOI | Venue |
---|---|---|
2003 | 10.1007/978-3-540-39958-2_8 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
operational semantics,distributed processing,higher order,type system | Operational semantics,Programming language,Computer science,Denotational semantics,Type erasure,Theoretical computer science,Failure semantics,Process replication,Process calculus,Calculus | Conference |
Volume | ISSN | Citations |
2884 | 0302-9743 | 12 |
PageRank | References | Authors |
0.64 | 17 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Philippe Bidinger | 1 | 69 | 4.82 |
Jean-Bernard Stefani | 2 | 1201 | 77.02 |