Abstract
We design a system with six Basic Combinators, and prove that it is powerful enough to embed the full asynchronous π-calculus, including replication. Our theory for constructing Combinatory Versions of concurrent languages is based on a method, used by Quine and Bernays, for the general elimination of variables in linguistic formalisms. Our Combinators are designed to eliminate the requirement of names that are bound by an input prefix. They also eliminate the need for input prefix, output prefix, and the accompanying mechanism of substitution. We define a notion of bisimulation for the combinatory version, and show that the combinatory version preserves the semantics of the original calculus. One of the distinctive features of this approach is that it can be used to rework many more process algebras in order to derive their equivalent Combinatory Versions.
Preview
Unable to display preview. Download preview PDF.
References
Abadi, M., Cardelli, L., Curien,P.L., Levy, J.J.: Explicit Substitutions, Proc. 17th ACM Annual Symposium on Principles of Programming Languages, (1990) 31–46.
Barendregt, H.: Lambda Calculus, Studies in Logic, 103, North-Holland (1981).
Bernays, P.: Über eine natürliche Erweiterung des Relationenkalkuls, in A. Heyting, ed. Constructivity in Mathematics, North-Holland (1959).
Berry, G., Boudol, G.: Chemical Abstract Machine, TCS 96 (1992) 217–248.
Boudol, G.: Towards a lambda-calculus for concurrent and communicating systems, Proc. TAPSOFT'89, LNCS 351 (1989) 149–161.
Boudol, G.: Asynchrony and the π-calculus, Research Report 1702, INRIA (1991).
De Bruijn, N.: Lambda-Calculus Notation with Nameless Dummies, A Tool for Automatic Formula Manipulation, Indeg. Mat. 34 (1972) 381–392.
Cleaveland, R., Yankelevich, D.: An Operational Framework for Value-Passing Processes, Proc. ACM Annual Symp. of Prog. Lang., (1994) 326–338.
Curien, P.-L.: Categorical Combinators, Sequential Algorithms and Functional Programming, Pitman (1986).
Curry, H.B., Feys, R.: Combinatory Logic, Vol. 1, North Holland (1958).
Hewitt, C., Bishop, P., Sterger, R.: A Universal Modulator Actor Formalism for Artificial Intelligence, Proc. IJCAI (1973) 235–245.
Hoare, C.: Communicating Sequential Processes, Prentice-Hall (1985).
Honda, K., Yoshida, N.: Combinatory Representation of Mobile Processes, Proc. ACM Annual Symposium of Programming Languages, ACM (1994) 348–360.
Honda, K., Yoshida, N.: Replication in Concurrent Combinators, Proc. TACS'94, LNCS 789 (1994) 786–805.
Kennaway, R., Sleep, R.: Director Strings as Combinators, TOPLAS, 10, 4 (1988).
Lafont, Y.: Interaction Nets, POPL'90, ACM (1990) 95–108.
Milner, R.: Action Structures, Research Report LFCS-92-249, Edinburgh (1992).
Milner, R.: Communication and Concurrency, Prentice Hall (1989).
Milner, R.: Functions as processes, Research Report 1154, INRIA (1990).
Milner, R.: The polyadic π-calculus: a tutorial, Marktoberdorf (1991).
Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes (Parts I and II), Information and Computation 100 (1992) 1–77.
Milner, R., Sangiorgi, D.: Barbed Bisimulation, ICALP'92, LNCS 623 (1992).
Quine, W.V.: Eliminating variables without applying functions to functions, Journal of Symbolic Logic 24, 4 (1959) 324–325.
Quine, W.V.: Variables Explained Away, Proc. American Philosophical Society, April 1960.
Raja, N., Shyamasundar, R.K.: The Next 700 Combinatory Representations of Mobile Processes, TIFR Research Report, Bombay (1994).
Raja, N., Shyamasundar, R.K.: The Quine-Bernays Combinatory Calculus, Int. Journal of Foundations of Comp. Sci., (to appear).
Russell, B., Whitehead, A.N.: Principia Mathematica, Vols. 1,2,3, CUP (1912).
Schönfinkel, M.: Über die Bausteine der mathematischen Logik, Math. Annalen 92 (1924) 305–316. English trans. with an introduction by W. V. Quine in J. van Heijenoort, ed., From Frege to Gödel, Harvard Univ. Press (1967) 355–366.
Thomsen, B.: Calculi for higher-order communicating systems, Ph.D. thesis, Imperial College (1990).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Raja, N., Shyamasundar, R.K. (1995). Combinatory formulations of concurrent languages. In: Kanchanasut, K., Lévy, JJ. (eds) Algorithms, Concurrency and Knowledge. ACSC 1995. Lecture Notes in Computer Science, vol 1023. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60688-2_42
Download citation
DOI: https://doi.org/10.1007/3-540-60688-2_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60688-8
Online ISBN: 978-3-540-49262-7
eBook Packages: Springer Book Archive