Type inference with extended pattern matching and subtypes
Fundamenta Informaticae - Special issue: lambda calculus and type theory
Type inference for records in natural extension of ML
Theoretical aspects of object-oriented programming
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A partially deadlock-free typed process calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
FMOODS '97 Proceedings of the IFIP TC6 WG6.1 international workshop on Formal methods for open object-based distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical Computer Science
Resource access control in systems of mobile agents
Information and Computation
Typing the Use of Resources in a Concurrent Calculus (Extended Abstract)
ASIAN '97 Proceedings of the Third Asian Computing Science Conference on Advances in Computing Science
ECOOP '94 Proceedings of the 8th European Conference on Object-Oriented Programming
The Name Discipline of Uniform Receptiveness (Extended Abstract)
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
On Asynchrony in Name-Passing Calculi
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
An Asynchronous Model of Locality, Failurem and Process Mobility
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
On message deliverability and non-uniform receptivity
Fundamenta Informaticae
Type inference for a distributed π-calculus
ESOP'03 Proceedings of the 12th European conference on Programming
Type inference for a distributed π-calculus
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Controlling process modularity in mobile computing
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Linear uniform receptiveness in a pi-calculus with location failures
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
| Hi-index | 0.00 |
We study an asynchronous distributed π-calculus, with constructs for localities and migration. We show that a static analysis ensures the receptiveness of channel names, which, together with a simple type system, guarantees the message deliverability property. This property states that any migrating message will find an appropriate receiver at its destination locality. We argue that this distributed, receptive calculus is still expressive enough while allowing for an effective type inference à la ML.