Lectures on a Calculus for Communicating Systems

  • Robin Milner
Conference paper
Part of the Springer Study Edition book series (volume 14)


Sequential computation, which until quite recently was the only mode of computation available in well-known programming languages, has a well-established model theory. This fact owes much to the lambda-calculus, which existed long before any notion of implementing a programming language. Yet the primary purpose of the lambda calculus was to study evaluation or execution; it was (and is) a paradigm for evaluation, in the same way that the predicate calculus is a paradigm for deduction. More recently, and largely due to Dana Scott, the model theory of the lambda calculus has grown and has been harmonised with its evaluation theory.


Normal Form Composition Operator Free Variable Lambda Calculus Agent Expression 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Costa, G. and Stirling, C. (1983). A Fair Calculus of Communicating Systems. Vol. 154, Lecture Notes in Computer Science, Springer-Verlag, pp. 97–108.Google Scholar
  2. 2.
    Hennessy, M. and Milner R. (1985). Algebraic Laws for Nondeterminism and Concurrency. J.ACM, Vol. 32, pp. 137–161.MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Hennessy, M. and Stirling, C. (1983). The Power of the Future Perfect in Program Logics. Technical Report CSR-156–83, Computer Science Dept, University of Edinburgh.Google Scholar
  4. 4.
    Hoare, C.A.R., Brookes, S.D. and Roscoe, A.D. (1981). A Theory of Communicating Sequential Processes, Technical Monograph PRG-16, Computing Laboratory, University of Oxford.Google Scholar
  5. 5.
    Milner, R. (1980). A Calculus of Communicating Systems. Vol. 92, Lecture Notes in Computer Science, Springer-Verlag.MATHGoogle Scholar
  6. 6.
    Milner, R. (1984) A Complete Inference System for a Class of Regular Behaviours. J. Computer and Systems Sciences, Vol. 28, pp. 439–466.MathSciNetMATHCrossRefGoogle Scholar
  7. 7.
    Milner, R. (1982b). A Finite Delay Operator in Synchronous CCS. Technical Report CSR-116–82, Computer Science Dept, University of Edinburgh.Google Scholar
  8. 8.
    Milner, R. (1983). Calculi for Synchrony and Asynchrony. J. Theor- etical Computer Science, Vol. 25,pp. 267–310.MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    de Nicola, R. and Hennessy, M. (1984). Testing Equivalences for Processes. J. Theoretical Computer Science, Vol. 34 pp. 83–135.MATHCrossRefGoogle Scholar
  10. 10.
    Park, D. (1981). Concurrency and Automata on Infinite Sequences. In Vol. 104, Lecture Notes in Computer Science, Springer-Verlag.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Robin Milner
    • 1
  1. 1.Department of Computer ScienceEdinburgh UniversityEdinburghUK

Personalised recommendations