Implicit Typing à la ML for the Join-Calculus

We adapt the Damas-Milner typing discipline to the join-calculus. The main result is a new generalization criterion that extends the polymorphism of ML to join-definitions. We prove the correctness of our typing rules with regard to a chemical semantics. We also relate typed extensions of the core join-calculus to functional languages.

[1]  Jean-Jacques Lévy,et al.  A Calculus of Mobile Agents , 1996, CONCUR.

[2]  Davide Sangiorgi,et al.  Typing and subtyping for mobile processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[3]  T. Vasco,et al.  Predicative Polymorphism in-Calculus , 1994 .

[4]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

[5]  Vasco Thudichum Vasconcelos.  Predicative Polymorphism in Pi-Calculus , 1994, PARLE.

[6]  Benjamin C. Pierce,et al.  Linearity and the pi-calculus , 1996, POPL '96.

[7]  Cédric Fournet,et al.  The reflexive CHAM and the join-calculus , 1996, POPL '96.

[8]  Robin Milner,et al.  Principal type-schemes for functional programs , 1982, POPL '82.

[9]  A. K. Wmght.  Polymorphism for imperative languages without imperative types , 1993 .

[10]  John H. Reppy.  Concurrent ML: Design, Application and Semantics , 1993, Functional Programming, Concurrency, Simulation and Automated Reasoning.

[11]  Matthias Felleisen,et al.  A Syntactic Approach to Type Soundness , 1994, Inf. Comput..