Abstract
In a process calculus, we say that a name x is uniformly receptive for a process P if:(1) at any time P is ready to accept an input at x, at least as long as there are processes that could send messages at x;(2) the input offer at x is functional, that is, all messages received by P at x are applied to the same continuation. In the π-calculus this discipline is employed, for instance, when modeling functions, objects, higher-order communications, or remote-procedure calls. We formulate the discipline of uniform receptiveness by means of a type system, and then we study its impact on behavioural equivalences and process reasoning. We develop some theory and proof techniques for uniform receptiveness, and illustrate their usefulness on some non-trivial examples.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
