Elements of Interaction: Turing Award Lecture

Communications of the ACM

Volumn 36, Issue 1, 1993, Pages 78-89

  Milner, Robin ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

CCS; interaction; naming and reference; pi calculus; process algebra; process calculus; reduction rule

Indexed keywords

CALCULATIONS; COMMUNICATION; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; COMPUTER SCIENCE;

CALCULUS FOR COMMUNICATING SYSTEMS; CONCURRENT COMPUTATION; INTERACTION; PROCESS CALCULUS; SEMANTICS;

COMPUTATION THEORY;

EID: 0027353881     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/151233.151240     Document Type: Article

References (38)

1. Abramsky, S. A domain equation for bisimulation. J. Inf. Comput. 92 (1991), 161-218.
2. Agha, G.A. Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press, Cambridge, Mass., 1986.
3. Astesiano, E. and Zucca, E. Parametric channels via label expressions in CCS. J. Theor. Comput. Sci. 33 (1984), 45-64.
4. Baeten, J.C.M. and Weijland, W.P. Process Algebra. Cambridge University Press, Cambridge, Mass., 1990.
5. Barendregt, H.P. The Lambda Calculus. North Holland, Amsterdam, 1981.
6. Böhm, C. and Berarducci, A. Automatic synthesis of typed A-programs on term algebras. J. Theor. Comput. Sci. 39 (1985), 135-154.
7. Brinksma, E. On the design of Extended LOTOS, A specification language for open distributed systems. Ph.D. dissertation, Univ. of Twente, 1988.
8. Brookes, S.D., Hoare, C.A.R., and Roscoe, A.W. A theory of communicating sequential processes. J. ACM 31 (1984), 560-599.
9. Church, A. The Calculi of Lambda Conversion. Princeton University Press, Princeton, N.J., 1946.
10. Engberg, U. and Nielsen, M. A calculus of communicating systems with label passing. Rep. DAIMI PB-208, Computer Science Dept., Univ. of Århus, Århus, Denmark, 1986.
11. Girard, J.-Y. The system F of variable types, fifteen years later. J. Theor. Comput. Sci. 45 (1986), 159-192.
12. Goldber, A. and Robson, D. Smalltalk-80: The Language and its Implementation. Addison-Wesley, Reading, Mass., 1983.
13. Gunter, C.A. and Scott, D.S. Semantic domains. In Handbook of Theoretical Computer Science, vol A. Elsevier, New York, 1990, pp. 633-674.
14. Hennessy, M. Algebraic Theory of Processes. MIT Press, Cambridge, Mass., 1988.
15. Hewitt, C.E., Bishop, P., and Steiger, R. A universal modular Actor formalism for artificial intelligence. In Proceedings of the International Joint Conference on Artificial Intelligence. 1973, pp. 235-245.
16. Hoare, C.A.R. Communicating sequential processes. Commun. ACM 21 (1978), 666-677.
17. Hoare, C.A.R. Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs, N.J., 1985.
18. Honda, K. and Tokoro, M. An object calculus for asynchronous communication. In Proceedings of the European Conference on Object-Oriented Programming. Lecture Notes in Computer Science, vol. 512. Springer-Verlag, New York, 1991, pp. 133-147.
19. Kennaway, J.R. and Sleep, M.R. Syntax and informal semantics of DyNe, a parallel language. In Lecture Notes in Computer Science, vol. 207. Springer-Verlag, New York, 1985, pp. 222-230.
20. Milner, R. Flow graphs and flow algebras. ACM 26, 4 (Oct. 1979), 794-818.
21. Milner, R. A Calculus of Communicating Systems. Lecture Notes in Computer Science, vol. 92. Springer-Verlag, New York, 1980.
22. Milner, R. Communication and Concurrency. Prentice-Hall, Englewood Cliffs, N.J., 1989.
23. Milner, R. The polyadic p-calculus: A tutorial. Res. Rep. LFCS-91-180, Lab. for Foundations of Computer Science, Computer Science Dept., Edinburgh Univ., 1991.
24. Milner, R. Functions as processes. Res. Rep. No. 1154, INRIA, Sophia Antipolis, 1990.
25. Milner, R., Parrow, J. and Walker, D. A calculus of mobile processes. Rep. ECS-LFCS-89-85 and -86, Lab. for Foundations of Computer Science, Computer Science Dept., Edinburgh Univ., 1989.
26. Newell, A. and Simon, H.A. Computer science as empirical enquiry: Symbols and search. Commun. ACM 19 (1976), 113-126.
27. Nielson, F. The typed?-calculus with first-class processes. In Proceedings of PARLE 89. Lecture Notes in Computer Science, vol. 366. Springer-Verlag, New York, 1989.
28. Nielsen, M., Plotkin, G.D. and Winskel, G. Petri nets, event structures and domains. J. Theor. Comput. Sci. 13 (1981).
29. Orava, F. and Parrow, J. An algebraic verification of a mobile network. Internal Rep., SICS, Sweden.
30. Park, D.M.R. Concurrency and automata on infinite sequences. In Lecture Notes in Computer Science, vol. 104. Springer-Verlag, New York, 1980.
31. Petri, C.A. Communikation mit Automaten. Schriften des Institutes für Instrumentelle Mathematik, Bonn, 1962. In German.
32. Plotkin, G.D. A powerdomain construction. SIAM J. Comput. 5 (1976), 452-487.
33. Reisig, W. Petri Nets. EATCS Monographs on Theoretical Computer Science, W. Brauer, G. Rozenberg, A. Salomaa, Eds. Springer-Verlag, New York, 1983.
34. Reynolds, J.C. Towards a theory of type structure. In Lecture Notes in Computer Science, vol. 19. Springer-Verlag, New York, 1974, pp. 408-425.
35. Sangiorgi, D. Forthcoming Ph.D. thesis. Univ. of Edinburgh, 1992.
36. Tennent, R.D. Principles of Programming Languages. Prentice-Hall, Englewood Cliffs, N.J., 1981.
37. Thomsen, B. Calculi for higher-order communicating systems. Ph.D. dissertation, Imperial College, London Univ., 1990.
38. Walker, D.J. p-calculus semantics of object-oriented programming languages. In Proceedings of the Conference on Theoretical Aspects of Computer Software (Japan). Lecture Notes in Computer Science, vol. 526. Springer-Verlag, New York, 1991, pp. 532-547.