Selected papers of the Second Workshop on Concurrency and compositionality
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
Theoretical aspects of object-oriented programming
Trust and partial typing in open systems of mobile agents
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type inference with constrained types
Theory and Practice of Object Systems - Special issue on foundations of object-oriented languages
Theoretical Computer Science
Simplifying subtyping constraints: a theory
Information and Computation
The Essence of Principal Typings
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
A versatile constraint-based type inference system
Nordic Journal of Computing
The receptive distributed π-calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Typing communicating component assemblages
GPCE '08 Proceedings of the 7th international conference on Generative programming and component engineering
Typing Component-Based Communication Systems
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
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 the type inference problem for a distributed π-calculus with explicit notions of locality and migration. Location types involve names that may be bound in terms. This requires an accurate new approach. We define a notion of principal typing. We provide a formal description of a sound and complete type inference algorithm.