skip to main content
article
Free Access

Elements of interaction: Turing award lecture

Published:01 January 1993Publication History
First page image

References

  1. 1 Abramsky, S. A domain equation for bisimulation. J. Inf. Comput. 92 (1991), 161-218. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 Agha, G.A.Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press, Cambridge, Mass., 1986 Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Astesiano, E. and Zucca, E. Parametric channels via label expressions in CCS, j, Theor. Comput,sci. 33 (1984), 45-64.Google ScholarGoogle Scholar
  4. 4 Baeten, J.C.M. and Weijland, W.P. Process Algebra. Cambridge University Press, Cambridge, Mass., 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 Barendregt, H.P. The Lambda, Calcu lus. North Holland, Amsterdam, 1981.Google ScholarGoogle Scholar
  6. 6 Bohm, C. and Berarducci. A. Automatic sythesis of typed A-programs on term algebras. J. Theor. Comput- Sci. 39 (1985), 135-154.Google ScholarGoogle ScholarCross RefCross Ref
  7. 7 Brinksma, E. On the Design of Extended Lotos, A specification language for open distributed systems. Ph.D. dissertation, Univ. of Twente, 1988.Google ScholarGoogle Scholar
  8. 8 Brookes. S.D., Hoare, C.A.R., and Roscoe, A.W. Atheory of communicating sequential processes J. ACM 31 (1984), 560-599. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 Church, A. The Calculi of Lambda Conversion. Princeton University Press, Princeton, N.J., 1946 Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10 Engberg. U. and Nielsen, M. A, calculus of communicating systems with label passing. Rep. DAIMI pb-208 Computer Science Dept., Univ. of Arhus, Arhus, Denmark, 1986.Google ScholarGoogle Scholar
  11. 11 Girard, J.-Y. The system F of variable types, fifteen years later. J. Theor. Comput, Sci 45 (1986), 159-192. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12 Goldber, A. and Robson, D. Smalltalk- 80: The Language and its Implementation Addison-Wesley, Reading Mass 1983 Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13 Gunter, C.A. and Scott, D.S. Semantic domains. In Handbook of Theretical Computer Science, Vol. A. Elsevier, New York, 1990, pp.633-674 Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14 Hennessy, M. Algebraic Theory of Processes . MIT Press, Cambridge, Mass., 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15 Hewitt, C.E., Bishop, P., Steiger, R.A. universal modular Actor formalsim for artificial intelligence. In proceedings of the INternational Joint Conference on Artificial Intelligence. 1973, on 235-245Google ScholarGoogle Scholar
  16. 16 Hoare, C.A.R. Communicating sequential i)r(messes. Commun. ACM 21 (1978), 666-677. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17 Hoare, C.A.R. Communicating Sequential t roces.ws. Ptenti(:e-Hat{, Englewood Clit!~. N.J., 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18 Honda. K. and Tokoro, M. An object calculas 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 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. Springerverlag, newyork, 1985, pp 222-Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 20 Milner, R~ Flow graphs and flow algebras. ACM 26, 4 (Oct. 1979), 794- 818, Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. 21 Milner, R. A Calculus of Communicating Systems. Lecture Notes in Computer Science, vol. 92. Springer- Verlag, New York 1980 Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. 22 Milner, R. Communication. and Concurrency. Prentice-Hall, Englewood Cliffs, N.J., 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. 23 Milner, R. The polyadic calculus; A tutorial. Res. Rep. LFCS. -91-180 Lab. for foundation of computer Science, Computer Science Dept., Edinburgh Univ., 1991.Google ScholarGoogle Scholar
  24. 24 Milner, R. Functions as processes. Res. Rep. No. 1154, INRIA, Sophia Antipolis, 1990,Google ScholarGoogle Scholar
  25. 25 Milner, R., Parrow, J. and Walker, D. A calculus of mobile processes. Rep. ECS-LFCS-89-85 and -86 Lab. for foundation of Computer Science, Computer, Science Dept., Edinburgh Univ. 1989.Google ScholarGoogle Scholar
  26. 26 Newell, A. and Simon, H.A. Computer seience as empriical enquiry; Symbols and search. Commun. ACM 19 (1976), 113-126 Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. 27 Nielson, F. The typed calculus with first-class processes. In Proceeeding of PARLE 89 Lecuture Notes in Computer Science, vol. 366. Springer- Verlag, New York, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. 28 Nielsen, M., Plotkin, G.D. and Winskel, G. Petri nets, event structures and domains. J. Theor. Comput- Sci, 13 (1981).Google ScholarGoogle Scholar
  29. 29 Orava, F. and Parrow,j. An algebraic verification of a mobile network, Internal Rep., SICS, Sweden.Google ScholarGoogle Scholar
  30. 30 Park, D.M.R, Concurrency and automate on infinite sequences. In Lecture Notes in Computer Science, vol. 104. Springer-Verlag, New York, 1980Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. 31 Petri, C.A. Communikation mit Automaten. Schriften des Institutes fur Instrumentelle Mathematik, Bonn I962. In German.Google ScholarGoogle Scholar
  32. 32 Plotkin, G.D. A powerdomain construction. SIAM j. Comput. 5 (1976), 452-487.Google ScholarGoogle Scholar
  33. 33 Reisig, W. Petri Nets. EEATCS Monographs on Theoretical Computer Science, W. Brauer, G. Rozenberg, A. Solomaa, Eds. Springer-Verlag, New} York, 1983.Google ScholarGoogle Scholar
  34. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. 35 Sangiorgi,. D. forthcoming Ph.D. thesis. Univ. of Edinburgh, 1992.Google ScholarGoogle Scholar
  36. 36 Tennent, R.D. Principles of Programming Languages. Prentice-Hall, Englewood Cliffs, N.J., 1981. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. 37 Thomsen, B. Caluli for higherorder communicating systems. Ph.D. dissertation, Imperial College, London Univ. 1990.Google ScholarGoogle Scholar
  38. 38 Walker, D.j. r-calculus semantics of object-oriented programming languages. In Proceedings the Conference on Theoretical Aspect, of Computer Software (Japan). Lecture Notes in Computer Science, vol. 526. Springer- Verlag, New York, 1991, pp. 532 - 547 Google ScholarGoogle Scholar

Index Terms

  1. Elements of interaction: Turing award lecture

                        Recommendations

                        Comments

                        Login options

                        Check if you have access through your login credentials or your institution to get full access on this article.

                        Sign in

                        Full Access

                        • Published in

                          cover image Communications of the ACM
                          Communications of the ACM  Volume 36, Issue 1
                          Jan. 1993
                          98 pages
                          ISSN:0001-0782
                          EISSN:1557-7317
                          DOI:10.1145/151233
                          Issue’s Table of Contents

                          Copyright © 1993 ACM

                          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                          Publisher

                          Association for Computing Machinery

                          New York, NY, United States

                          Publication History

                          • Published: 1 January 1993

                          Permissions

                          Request permissions about this article.

                          Request Permissions

                          Check for updates

                          Qualifiers

                          • article

                        PDF Format

                        View or Download as a PDF file.

                        PDF

                        eReader

                        View online with eReader.

                        eReader