Type inference for records in natural extension of ML
Theoretical aspects of object-oriented programming
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Controlling interference in ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Atomic failure in wide-area computation
Fourth International Conference on Formal methods for open object-based distributed systems IV
Bisimulation congruences in safe ambients
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Nomadic Pict: Language and Infrastructure Design for Mobile Agents
IEEE Concurrency
Some Results in the Joint-Calculus
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Using Ambients to Control Resources
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Safe Dynamic Binding in the Join Calculus
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Secure composition of untrusted code: box π, wrappers, and causality types
Journal of Computer Security - CSFW13
Channel dependent types for higher-order mobile processes
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstractions for fault-tolerant global computing
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Proceedings of the 5th international conference on Generative programming and component engineering
Basic observables for a calculus for global computing
Information and Computation
Oz/K: a kernel language for component-based open programming
GPCE '07 Proceedings of the 6th international conference on Generative programming and component engineering
Type-safe higher-order channels in ML-like languages
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Electronic Notes in Theoretical Computer Science (ENTCS)
SuMo: A Framework for Prototyping Distributed and Mobile Software
ICA3PP '08 Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing
Type-safe higher-order channels with channel locality1
Journal of Functional Programming
Formal Aspects in Security and Trust
Security Policies as Membranes in Systems for Global Computing
Electronic Notes in Theoretical Computer Science (ENTCS)
Bisimulations for a distributed higher order π-calculus
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Characterizing contextual equivalence in calculi with passivation
Information and Computation
Basic observables for a calculus for global computing
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A mobile agent service-oriented scripting language encoded on a process calculus
JMLC'06 Proceedings of the 7th joint conference on Modular Programming Languages
Extending howe's method to early bisimulations for typed mobile embedded resources with local names
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
The kell calculus: a family of higher-order distributed process calculi
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
A generic membrane model (note)
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
An abstract machine for the kell calculus
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
A component model for the ABS language
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
| Hi-index | 0.00 |
This paper presents a new distributed process calculus, called the M-calculus, that can be understood as a higher-order version of the Distributed Join calculus with programmable localities. The calculus retains the implementable character of the Distributed Join calculus while overcoming several important limitations: insufficient control over communication and mobility, absence of dynamic binding, and limited locality semantics. The calculus is equipped with a polymorphic type system that guarantees the unicity of locality names, even in presence of higher-order communications -- a crucial property for the determinacy of message routing in the calculus.