Abstract
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.
Note (November 1985): In the original version of this paper Proposition 2.6 was wrongly stated. This has been corrected, with a few resulting changes to the proof of Proposition 2.7.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Costa, G. and Stirling, C. (1983). A Fair Calculus of Communicating Systems. Vol. 154, Lecture Notes in Computer Science, Springer-Verlag, pp. 97–108.
Hennessy, M. and Milner R. (1985). Algebraic Laws for Nondeterminism and Concurrency. J.ACM, Vol. 32, pp. 137–161.
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.
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.
Milner, R. (1980). A Calculus of Communicating Systems. Vol. 92, Lecture Notes in Computer Science, Springer-Verlag.
Milner, R. (1984) A Complete Inference System for a Class of Regular Behaviours. J. Computer and Systems Sciences, Vol. 28, pp. 439–466.
Milner, R. (1982b). A Finite Delay Operator in Synchronous CCS. Technical Report CSR-116–82, Computer Science Dept, University of Edinburgh.
Milner, R. (1983). Calculi for Synchrony and Asynchrony. J. Theor- etical Computer Science, Vol. 25,pp. 267–310.
de Nicola, R. and Hennessy, M. (1984). Testing Equivalences for Processes. J. Theoretical Computer Science, Vol. 34 pp. 83–135.
Park, D. (1981). Concurrency and Automata on Infinite Sequences. In Vol. 104, Lecture Notes in Computer Science, Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Milner, R. (1986). Lectures on a Calculus for Communicating Systems. In: Broy, M. (eds) Control Flow and Data Flow: Concepts of Distributed Programming. Springer Study Edition, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82921-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-82921-5_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17082-2
Online ISBN: 978-3-642-82921-5
eBook Packages: Springer Book Archive