Abstract
The present paper introduces a typing system for a version of Milner's polyadic π-calculus, and a typing inference algorithm linear on the size of the input. The central concept underlying the typing system is the notion of type assignment, where each free name in a term is assigned a type, the term itself being given multiple nametype pairs. This observation leads to a clean typing system for Milner's sorting, and induces an efficient algorithm to infer the typing of a term. The typing system enjoys a subject-reduction property and possesses a notion of principal typing scheme. The algorithm to reconstruct the principal typing scheme of a process, or to detect its inexistence, is proved correct with respect to the typing system.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Felice Cardone and Mario Coppo. Two Extensions of Curry's Type Inference System. In Logic and Computer Science, pages 19–75, Academic Press limited, 1990.
Bruno Courcelle. Fundamental properties of infinite trees. Theoretical Computer Science, 25:95–169, 1983.
Luis Damas and Robin Milner. Principal type-schemes for functional programs. In 9th ACM Symposium on Principles of Programming Languages, pages 207–212, 1982.
Simon J. Gay. A sort inference algorithm for the polyadic π-calculus. In 20th ACM Symposium on Principles of Programming Languages, 1993.
R. Hindley. The principal type-scheme of an object in combinatoric logic. Transactions of the American Mathematical Society, 146:29–60, December 1969.
Kohei Honda. Types for Dyadic Interaction. In this volume. Also available as Keio University Report CS-92-3.
Kohei Honda and Mario Tokoro. On Asynchronous Communication Semantics. In ObjectBased Concurrent Computing, pages 21–51, Springer-Verlag, 1992. LNCS 612.
D. MacQueen, G. Plotkin, and R. Sethi. An ideal model for recursive polymorphic types. Information and Control, 71:91–130, 1986.
Robin Milner. Functions as Processes. Automata, Language and Programming, Springer-Verlag, LNCS 443, 1990. Also as Rapport de Recherche No 1154, INRIA-Sophia Antipolis, February 1990.
Robin Milner. The Polyadic π-Calculus: a Tutorial ECS-LFCS 91-180, University of Edinburgh, October 1991.
Robin Milner, Joachim Parrow, and David Walker. A Calculus of Mobile Processes, Part I and II. ECS-LFCS 89-85/86, University of Edinburgh, June 1989.
Benjamin Pierce and Davide Sangiorgi. Typing and subtyping for mobile processes. In 1993 IEEE Symposium on Logic in Computer Science, June 1993.
Vasco T. Vasconcelos. A predicative polymorphic type system for the polyadic π-calculus. 1993. Keio University.
Vasco T. Vasconcelos and Kohei Honda. Principal typing-schemes in a polyadic π-calculus. CS 92-4, Keio University, 1992.
Mitchell Wand. A simple algorithm and proof for type inference. Fundamenta Informaticae, X:115–122, 1987. North-Holland.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vasconcelos, V.T., Honda, K. (1993). Principal typing schemes in a polyadic π-calculus. In: Best, E. (eds) CONCUR'93. CONCUR 1993. Lecture Notes in Computer Science, vol 715. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57208-2_36
Download citation
DOI: https://doi.org/10.1007/3-540-57208-2_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57208-4
Online ISBN: 978-3-540-47968-0
eBook Packages: Springer Book Archive