Abstract
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.
This work is partly supported by the ESPRIT CONFBR-2 WG-21836
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. Damas and R. Milner. Principal type schemes for functional programs. In Proceedings on Principles of Programmining Languages, pages 207–212, 1982.
C. Fournet and G. Gonthier. The reflexive chemical abstract machine and the join-calculus. In 23rd ACM Symposium on Principles of Programming Languages (POPL'96), 1996.
C. Fournet, G. Gonthier, J.-J. Lévy, L. Maranget, and D. Rémy. A calculus of mobile agents. In 7th International Conference on Concurrency Theory (CONCUR'96), 1996. LNCS 1119.
N. Kobayashi, B. C. Pierce, and D. N. Turner. Linear types and picalculus. In 23rd ACM Symposium on Principles of Programming Languages (POPL'96), 1996.
K. Läufer and M. Odersky. An extension of ML with first-class abstract types. In Proceedings of the ACM SIGPLAN Workshop on ML and its Applications, 1992.
R. Milner. The polyadic π-calculus: a tutorial. In Bauer, Brawer, and Schwichtenberg, editors, Logic and Algebra of Specification. Springer Verlag, 1993.
B. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. In Logic in Computer Science, pages 187–215, 1993.
B. Pierce and D. Turner. Pict: a programming language based on the pi-calculus, 1995. To appear.
J. H. Reppy. Concurrent ML: Design, application and semantics. In Programming, Concurrency, Simulation and Automated Reasoning, pages 165–198, 1992. LNCS 693.
B. Thomsen. Polymorphic sorts and types for concurrent functional programs. Technical Report ECRC-93-10, European Computer-Industry Research Center, Munich, Germany, 1993.
D. N. Turner. The π-calculus: Types, polymorphism and implementation. PhD thesis, LFCS, University of Edinburgh, 1995.
V. T. Vasconcelos. Predicative polymorphism in the π-calculus. In Proceedings of 5th Conference on Parallel Architectures and Languages (PARLE 94), 1994. LNCS.
A. K. Wright. Polymorphism for imperative languages without imperative types. Technical Report 93-200, Rice University, February 1993.
A. K. Wright and M. Felleisen. A syntactic approach to type soundness. Information and Computation, 115(1):38–94, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fournet, C., Maranget, L., Laneve, C., Rémy, D. (1997). Implicit typing à la ML for the join-calculus. In: Mazurkiewicz, A., Winkowski, J. (eds) CONCUR '97: Concurrency Theory. CONCUR 1997. Lecture Notes in Computer Science, vol 1243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63141-0_14
Download citation
DOI: https://doi.org/10.1007/3-540-63141-0_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63141-5
Online ISBN: 978-3-540-69188-4
eBook Packages: Springer Book Archive