Programming with intersection types and bounded polymorphism
Programming with intersection types and bounded polymorphism
Complete restrictions of the intersection type discipline
Theoretical Computer Science
A sort inference algorithm for the polyadic &pgr;-calculus
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus of mobile processes, I
Information and Computation
Intersection type assignment systems
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Behavioral equivalence in the polymorphic pi-calculus
Journal of the ACM (JACM)
Predicative Polymorphism in Pi-Calculus
PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
A Fully Abstract Model for Higher-Order Mobile Ambients
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Principal Typing Schemes in a Polyadic pi-Calculus
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
A Polymorphic Type System for the Polyadic pi-calculus
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
On the expressive power of polyadic synchronisation in π-calculus
Nordic Journal of Computing
A filter model for mobile processes
Mathematical Structures in Computer Science
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
RANK 2 INTERSECTION TYPE ASSIGNMENT IN TERM REWRITING SYSTEMS
Fundamenta Informaticae
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
| Hi-index | 0.00 |
We introduce channel sequence types to study finitary polymorphism in the context of mobile processes modelled in the @p-calculus. We associate to each channel a set of exchange types, and we require that output processes send values of one of those types, and input processes accept values of any type in the set. Our type assignment system enjoys subject reduction and guarantees the absence of communication errors. We give several examples of polymorphism, and we encode the @l-calculus with the strict intersection type discipline.