Abstract
While types for name passing calculi have been studied extensively in the context of sorting of polyadic π-calculus [5, 34, 9, 28, 32, 19, 33, 10, 17], the same type abstraction is not possible in the monadic setting, which was left as an open issue by Milner [21]. We solve this problem with an extension of sorting which captures dynamic aspects of process behaviour in a simple way. Equationally this results in the full abstraction of the standard encoding of polyadic π-calculus into the monadic one: the sorted polyadic π-terms are equated by a basic behavioural equality in the polyadic calculus if and only if their encodings are equated in a basic behavioural equality in the typed monadic calculus. This is the first result of this kind we know of in the context of the encoding of polyadic name passing, which is a typical example of translation of high-level communication structures into π-calculus. The construction is general enough to be extendable to encodings of calculi with more complex operational structures.
Partially supported by JSPS Fellowship for Japanese Junior Scientists and Ogata-jyosei grant of Keio University.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Abramsky, S., Gay, S. and Nagarajan, R., Interaction Categories and Foundations of Typed Concurrent Computing. Deductive Program Design, Springer-Verlag, 1995.
Boudol, G., Asynchrony and π-calculus. INRIA Report 1702, INRIA, Sophia Antipolis, 1992.
Davey, B.A. and Priestley, H.A., Introduction to Lattices and Order, CUP, 1990.
Fournet, C. and Gonthier, G., The reflexive CHAM and the join-calculus, POPL'96, pp.372–385, ACM Press, 1996.
Gay, S., A Sort Inference Algorithm for the Polyadic π-Calculus. POPL'93, ACM Press, 1993.
Gay, S. and Nagarajan, R., A Typed Calculus of Synchronous Processes. LICS'95, IEEE, pp.210–220, 1995.
Girard, J.-Y., Linear Logic, TCS, Vol. 50, pp.1–102, North-Holland, 1987.
Honda, K., Pre-types in mobile processes, a manuscript, 1992.
Honda, K., Types for Dyadic Interaction. CONCUR'93, LNCS 715, pp.509–523, Springer, 1993.
Honda, K., Composing Processes, POPL'96, pp.344–357, ACM Press, 1996.
Honda, K., Name-Passing Games (I): Semantics of Sortings, a type-script, July, 1996.
Honda, K. and Tokoro, M., An Object Calculus for Asynchronous Communication. ECOOP'91, LNCS 512, pp.133–147, Springer-Verlag 1991.
Honda, K. and Yoshida, N., Combinatory Representation of Mobile Processes, POPL'94, pp.348–360, ACM Press, 1994.
Honda, K. and Yoshida, N., Replication in Concurrent Combinators, TACS'94, LNCS 789, pp.786–805, Springer, 1994.
Honda, K. and Yoshida, N., On Reduction-Based Process Semantics. TCS, pp.437–486, No.151, North-Holland, December, 1995.
Jones, C.B., Process-Algebraic Foundations for an Object-Bated Design Notation. UMCS-93-10-1, Manchester University, 1993.
Kobayashi, N., Pierce, B., and Turner, D., Linear Types and π-calculus, POPL'96, pp.358–371, ACM Press, 1996.
Lafont, Y., Interaction Nets, POPL'90, pp. 95–108, ACM press, 1990.
Liu, X. and Walker, D., A polymorphic type system for the polyadic pi-calculus, CONCUR'95, LNCS 962, pp.103–116, Springer, 1995.
Milner, R., Functions as Processes. MSCS, 2(2), pp.119–146, 1992.
Milner, R., Polyadic π-Calculus: a tutorial. Logic and Algebra of Specification, Springer, 1992.
Milner, R., Parrow, J.G. and Walker, D.J., A Calculus of Mobile Processes, Information and Computation 100(1), pp.1–77, 1992.
Milner, R. and Sangiorgi, D., Barbed Bisimulation. Proc. of ICALP'92, LNCS 623, pp.685–695, Springer-Verlag, 1992.
Mitchell, J., Type Systems for Programming Languages. Handbook of Theoretical Computer Science B, pp.367–458, MIT Press, 1990.
Montanari, U. and Pistore, M., Concurrent Semantics for π-calculus, MFCS'95 and ENTCS, Vol. 1. Elsevier, 1995.
Odersky, M., Polarized Name Passing. FSTTCS'15, LNCS 1026, pp.324–335, Springer, 1995.
Pierce, B.C., Linearized Types for the π-calculus, a type script, December, 1994.
Pierce, B.C. and Sangiorgi. D, Typing and subtyping for mobile processes. LICS'93, pp.187–215, IEEE, 1993.
Raja, N. and Shyamasundar, R.K., Combinatory Formulations of Concurrent Languages, pp. 156–170, ACSC'95, LNCS 1023, Springer-Verlag, 1995.
Sangiorgi, D., Expressing Mobility in Process Algebras: First Order and Higher Order Paradigms. Ph.D. Thesis, University of Edinburgh, 1992.
Prasad, S., Towards a Formulae-as-Types View of Communicating Applicative Processes, Technical report ECRC-94-32, ECRC, 1994.
Takeuchi, K., Honda, K. and Kubo, M., An Interaction-based Language and its Typing System. PARLE'94, LNCS 817, pp.398–413, Springer-Verlag, 1994.
Turner, D., The π-calculus: Types, polymorphism and implementation, Phd Thesis, University of Edinburgh, 1996.
Vasconcelos, V. and Honda, K., Principal Typing Scheme for Polyadic π-Calculus. CONCUR'93, LNCS 715, pp.524–538, Springer-Verlag, 1993.
Winskel, G., An Introduction to Event Structures. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354, pp. 364–397.
Yoshida, N., Graph Types for Mobile Process Calculi I. The full version of this paper. CS technical report, Keio University, 1996. Available from ftp.dcs.ed.ac.uk/export/ny/pub/graphi.ps.Z.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yoshida, N. (1996). Graph types for monadic mobile processes. In: Chandru, V., Vinay, V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1996. Lecture Notes in Computer Science, vol 1180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62034-6_64
Download citation
DOI: https://doi.org/10.1007/3-540-62034-6_64
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62034-1
Online ISBN: 978-3-540-49631-1
eBook Packages: Springer Book Archive