Towards a lambda-calculus for concurrent and communicating systems

  • Gérard Boudol
Part of the Lecture Notes in Computer Science book series (LNCS, volume 351)


We introduce a calculus for concurrent and communicating processes, which is a direct and simple extension of the λ-calculus. The communication mechanism we use is that of Milner's calculus CCS: to communicate consists in synchronously sending and receiving a value through a shared port. Then the calculus is parameterized on a given set of port names, which are used in the two primitives for sending and receiving a value — as in the λ-calculus, a value can be any term. We use two parallel constructs: the first is interleaving, which does not allow communication between agents. The second, called cooperation, is a synchronizing construct which forces two agents to communicate on every port name. We show that the λ-calculus is a simple sub-calculus of ours: λ-abstraction is a particular case of reception (on a port named λ), and application is a particular case of cooperation.


  1. [1]
    S. Abramsky, The Lazy Lambda-Calculus, to appear in Declarative Programming, Ed. D. Turner, Addison Wesley (1988).Google Scholar
  2. [2]
    H.P. Barendregt, The Lambda Calculus, Studies in Logic 103, North-Holland (1981).Google Scholar
  3. [3]
    J.-J. Lévy, An Algebraic Interpretation of the λβK-Calculus; and an Application of a Labelled λ-Calculus, Theoretical Comput. Sci. 2 (1976) 97–114.Google Scholar
  4. [4]
    R. Milner, Flowgraphs and Flow Algebras, JACM 26 (1979) 794–818.Google Scholar
  5. [5]
    R. Milner, A Calculus of Communicating Systems, Lecture Notes in Comput. Sci. 92 (1980) reprinted in Report ECS-LFCS-86-7, Edinburgh University.Google Scholar
  6. [6]
    A. Stoughton, Substitution Revisited, Theoretical Comput. Sci. 59 (1988) 317–325.Google Scholar
  7. [7]
    B. Thomsen, A Calculus of Higher Order Communicating Systems, to appear in the Proceedings of POPL 89 (1989).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Gérard Boudol
    • 1
  1. 1.INRIA Sophia-AntipolisValbonneFrance

Personalised recommendations