Abstract
We establish the behavioural representability of input prefix and replication, which are two basic operators of the asynchronous ν-calculus [5, 6] (cf. [2]), an offspring of π-calculus [14, 11], in a system of concurrent combinators which is an extension of cc [7]. Systems of concurrent combinators are simple formal systems based on a finite number of atoms with fixed interaction rules and two connectives for term formation, namely, concurrent composition and name hiding. Since such a system does not own inductively defined syntactic constructs for prefix or replication, their representability using a fixed number of atoms is theoretically interesting, reminiscent of the similar results obtained by Schönfinkel and Curry in the context of the classical combinators.
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., The Lazy Lambda Calculus. D. Turner, editor, Research topics in Functional Programming, Addison Wesley, 1990.
Boudol, G., Asynchrony and π-calculus, INRIA Report 1702, INRIA, Sophia Antipolis, May, 1991.
Girard, J.-Y., Linear Logic, Theoretical Computer Science, Vol. 50, pp.1–102, 1987.
Honda, K., Kubo, M. and Yoshida, N., Combinatory Representation of Mobile Processes Part I/II, To appear as Keio CS Technical Report, 1994.
Honda, K. and Tokoro, M., An Object Calculus for Asynchronous Communication. ECOOP'91, LNCS 512, pp.21–52, Springer-Verlag 1991.
Honda, K. and Yoshida, N., On Reduction-Based Process Semantics, Foundations of Software Technology and Theoretical Computer Science, LNCS 761, pp.371–387, Springer-Verlag, 1993.
Honda, K. and Yoshida, N., Combinatory Representation of Mobile Processes, Proc. 21th. Annual Symposium on Principles of Programming Languages, pp.348–360, ACM press, 1994.
Jones, C.B., Constraining interference in an object-based design method, TAPSOFT'93, LNCS 668, pp.136–150, Springer Verlag, 1993.
Lafont, Y., Interaction Nets, Proc. 17th. Annual Symposium on Principles of Programming Languages, pp. 95–108, ACM press, 1990.
Milner, R., A Calculus of Communicating Systems, LNCS 76, Springer Verlag, 1980.
Milner, R., Functions as Processes. Mathematical Structure in Computer Science, 2(2), pp.119–146, 1992.
Milner, R., Polyadic π-Calculus. Logic and Algebra of Specification, Springer-Verlag, 1992.
Milner, R. and Sangiorgi, D., Barbed Bisimulation. Proc. of ICALP'92, LNCS 623, pp.685–695, Springer-Verlag, 1992.
Milner, R., Parrow, J.G. and Walker, D.J., A Calculus of Mobile Processes, Information and Computation 100(1), pp.1–77, 1992.
Thomsen, B., A calculus of higher order communicating systems. Proc. 16th. Annual Symposium on Principles of Programming Languages, pp. 143–145, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Honda, K., Yoshida, N. (1994). Replication in concurrent combinators. In: Hagiya, M., Mitchell, J.C. (eds) Theoretical Aspects of Computer Software. TACS 1994. Lecture Notes in Computer Science, vol 789. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57887-0_125
Download citation
DOI: https://doi.org/10.1007/3-540-57887-0_125
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57887-1
Online ISBN: 978-3-540-48383-0
eBook Packages: Springer Book Archive