Preview
Unable to display preview. Download preview PDF.
References
(Goguen, J.A., Thatcher, J.W., Wagner, E.G. and Wright, J.B.) (1977) Initial algebra semantics and continuous algebras. JACM, Vol. 24, No. 1, 68–95.
Apt, K.R. (1979) Ten years of Hoare's logic, a survey. To appear.
Barendregt, H. (1977) The type-free lambda calculus. Handbook of Mathematical Logic (ed. J. Barwise), pp. 1092–1131, Amsterdam: North Holland.
Berry, G. (1979) Modèles Complètement Adéquats et Stables des Lambda-Calculus Typeées. Thèse de doctorat d'état. Université Paris VII.
Curry, H.B., Feys, R. and Craig, W. (1968) Combinatory Logic, Volume 1. Amsterdam: North Holland.
Hennessy, M.C.B. and Plotkin, G.D. (1979) Full abstraction for a simple parallel programming language. MFCS '79, Olomouc. Springer-Verlag Lecture Notes in Computer Science, Vol. 74, pp. 108–120.
Hennessy, M.C.B. and Milner, R. (1980) On observing nondeterminism and concurrency. ICALP '80. Noordwijkerhout. Springer Verlag Lecture Notes in Computer Science. To appear.
Hindley, J.R., Lercher, B. and Seldin, J.P. (1972) Introduction to combinatory logic. Cambridge: Cambridge University Press.
Hindley, J.R. and Longo, B. (1978) Lambda calculus models and extensionality. Universita degli Studi di Pisa, Istituto di Scienze dell'Informazione. Note Scientifiche S-78-4.
Landin, P.J. (1966) A lambda-calculus approach. Chapter 5. Advances in Programming and Non-Numerical Computation. Pergamon Press.
Milne, G.J. and Milner, R. (1979) Concurrent processes and their syntax. JACM, Vol. 26, No. 2, 302–321.
Milner, R. (1976) Models of LCF. Mathematical Centre Tracts, 82, pp. 49–63. Amsterdam.
Milner, R. (1977) Fully abstract models of typed λ-calculi. Theoretical Computer Science, Vol. 4, 1–22.
Milner, R. (1978) Algebras for communicating systems. Proc. AFCET/SMF Joint Colloquium in Applied Mathematics (Palaiseau, France). Also available as CSR-25-78, Computer Science Department, University of Edinburgh, 1978.
Milner, R. (1978) Synthesis of communicating behaviour. Proc. 7th MFCS Conference, Zakopane, Poland. Springer Verlag Lecture Notes in Computer Science, Vol.64, pp. 71–83. Berlin: Springer Verlag.
Milner, R. (1979) An algebraic theory for synchronisation. Theoretical Computer Science 4th GI Conference, Aachen. Springer Verlag Lecture Notes Computer Science, Vol. 67, pp. 27–35. Berlin: Springer Verlag.
Milner, R. (1979) Flowgraphs and flow algebras. JACM, Vol. 26, No. 4, 794–818.
Obtulowicz, A. (1977) Functorial semantics of the type free calculus. Fundamentals of Computation Theory. Springer Verlag Lecture Notes in Computer Science, Vol. 56, pp. 302–207. Berlin: Springer Verlag.
Petri, C.A. (1976) Nichtsequentielle Prozesse. Arbeitsberichte des IMMD, Bd. 9, Heft. 8, p.57 ff. Universität Erlangen-Nurnberg. Also Non Sequential Processes, Translation by P. Krause and J. Low. Internal Report GMD-ISF-77-05, Bonn (1977).
Plotkin, G.D. (1976) A powerdomain construction. SIAM Journal on Computing, Vol. 5, No. 3, 452–487.
Smyth, M. (1978) Powerdomains. JCSS, Vol. 16, No. 1.
Wegner, P. (1972) The Vienna definition language. Computing Surveys, Vol. 4, No. 1.
Hoare, C.A.R. (1978) Communicating sequential processes. CACM, Vol. 21, No. 8, 666–677.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hennessy, M.C.B., Plotkin, G.D. (1980). A term model for CCS. In: Dembiński, P. (eds) Mathematical Foundations of Computer Science 1980. MFCS 1980. Lecture Notes in Computer Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022510
Download citation
DOI: https://doi.org/10.1007/BFb0022510
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10027-0
Online ISBN: 978-3-540-38194-5
eBook Packages: Springer Book Archive