Information and Computation
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Strong normalisation in the π-calculus
Information and Computation
Mathematical Structures in Computer Science
Ensuring termination by typability
Information and Computation
On the complexity of termination inference for processes
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
The kell calculus: a family of higher-order distributed process calculi
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
Mobile processes and termination
Semantics and algebraic specification
| Hi-index | 0.00 |
We study termination of programs in concurrent higher-order languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing concurrent calculi. However, in contrast with the λ-calculus, a simply-typed discipline need not guarantee termination; and, in contrast with message-passing calculi such as the π-calculus, divergence can be obtained even without a recursion (or replication) construct. We first consider a higher-order calculus where only processes can be communicated. We propose a type system for termination that borrows ideas from termination in Rewriting Systems (and following the approach to termination in the π-calculus in [DS06]). We then show how this type system can be adapted to accommodate higher-order functions in messages. Finally, we address termination in a richer calculus, that includes localities and a passivation construct, as well as name-passing communication. We illustrate the expressiveness of the type systems on a few examples.