A foundation for actor computation

Journal of Functional Programming

Volumn 7, Issue 1, 1997, Pages 1-72

  Agha, Gul A ^a   Mason, Ian A ^b   Smith, Scott F ^c   Talcott, Carolyn L ^d  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b UNIVERSITY OF NEW ENGLAND   (Australia)

^c JOHNS HOPKINS UNIVERSITY   (United States)

^d STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031530396     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S095679689700261X     Document Type: Article

References (61)

1. Abadi, M. and Cardelli, L. (1994) A theory of primitive objects: Untyped and first-order systems. In Theoretical Aspects of Computer Software, Lecture Notes in Computer Science 789, pp. 296-320. Springer-Verlag.
2. Abelson, H. and Sussman, G. J. (1985) Structure and Interpretation of Computer Programs. MIT Press, McGraw-Hill.
3. Abramsky, S. (1991) A domain equation for bisimulation. Information and Computation, 92(2), 161-218.
4. Agha, G. (1986) Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press.
5. Agha, G. (1990) Concurrent object-oriented programming. Comm. ACM, 33(9), 125-141.
6. Agha, G., Frølund, S., Kim, W., Panwar, R., Patterson, A. and Sturman, D. (1993a) Abstraction and Modularity Mechanisms for Concurrent Computing. IEEE Parallel and Distributed Technology: Systems and Applications, 1(2), 3-14.
7. Agha, G., Hewitt, C., Wegner, P. and Yonezawa, A. (eds.) (1991) Proc. ACM SIGPLAN Workshop on Object-Based Concurrent Programming. OOPS Messenger, 2(2).
8. Agha, G., Mason, I. A., Smith, S. F. and Talcott, C. L. (1992). Towards a theory of actor computation. Third International Conference on Concurrency Theory (CONCUR '92), Lecture Notes in Computer Science 630, pp. 565-579. Springer-Verlag.
9. Agha, G., Wegner, P. and Yonezawa, A. (eds.) (1989) Proc. ACM SIGPLAN Workshop on Object-Based Concurrent Programming. Special Issue of SIGPLAN Notices.
10. Agha, G., Wegner, P. and Yonezawa, A. (eds.) (1993b) Research Directions in Concurrent Object Oriented Programming. MIT Press.
11. Amadio, R. M. (1994) Translating core facile. Technical Report ECRC-1994-3, European Computer-Industry Research Centre.
12. Armstrong, J., Virding, R. and Williams, M. (1993) Concurrent Programming in Erlang. Prentice Hall.
13. Attardi, G. and Hewitt, C. (1978) Specifying and proving properites of guardians for distributed systems.
14. Baker, H. G. and Hewitt, C. (1977) Laws for communicating parallel processes. IFIP Congress, pp. 987-992. IFIP.
15. Bergstra, J. A. and Klop, J. W. (1986) Process Algebra: Specification and Verification in Bisimulation Semantics. Number CWI Monograph 4 in Mathematics and Computer Science, II. North-Holland.
16. Brookes, S., Hoare, C. and Roscoe, A. (1984). A Theory of Communicating Sequential Processes. J. ACM, 31(3), 560-599.
17. Cardelli, L. (1986) Amber. In Combinators and functional programming languages. Lecture Notes in Computer Science 242. Springer-Verlag.
18. Cardelli, L. (1994) Obliq: A language with distributed scope. Technical Report SRC Research Report 122, Digital Equipment Corporation, Systems Research Center.
19. Clinger, W. D. (1981) Foundations of actor semantics. AI-TR-633, MIT Artificial Intelligence Laboratory.
20. de Nicola, R. and Hennessy, M. C. B. (1984) Testing equivalences for processes. Theoretical Computer Science, 34, 83-133.
21. Felleisen, M. and Friedman, D. (1986) Control operators, the SECD-machine, and the λ-calculus. In Wirsing, M. (ed.), Formal Description of Programming Concepts III, pp. 193-217. North-Holland.
22. Felleisen, M. and Hieb, R. (1992) The revised report on the syntactic theories of sequential control and state. Theoretical Computer Science, 103, 235-271.
23. Felleisen, M. and Wright, A. K. (1994) A syntactic approach to type soundness. Information & Computation, 115(1), 38-94.
24. Giacalone, A., Mishra, P. and Prasad, S. (1989) Facile: A symmetric integration of concurrent and functional programming. International Journal of Parallel Programming, 18(2), 121-160.
25. Greif, I. (1975) Semantics of communicating parallel processes. Technical Report 154, MIT, Project MAC.
26. Hewitt, C. (1971) Description and Theoretical Analysis (Using Schemata) of PLANNER: A Language for Proving Theorems and Manipulating Models in a Robot. PhD thesis, MIT.
27. Hewitt, C. (1977) Viewing control structures as patterns of passing messages. Journal of Artificial Intelligence, 8(3), 323-364.
28. Hewitt, C. and Atkinson, R. (1979) Specifications and proof techniques for serializes. IEEE Transactions on Software Engineering, SE-5(1), 10-23.
29. Hewitt, C., Bishop, P. and Steiger, R. (1973) A universal modulal actor formalism for artificial intelligence. Proc. International Joint Conference on Artificial Intelligence, pp. 235-245.
30. Hoare, C. A. R. (1985) Communicating Sequential Processes. Prentice-Hall.
31. Honda, K. and Tokoro, M. (1991) An object calculus for asynchronous communication. ECOOP'91, Lecture Notes in Computer Science 512, pp. 133-147. Springer-Verlag.
32. Honsell, F., Mason, I. A., Smith, S. F. and Talcott, C. L. (1995) A Variable Typed Logic of Effects. Information and Computation, 119(1), 55-90.
33. Kornfeld, W. A. and Hewitt, C. (1981) The scientific community metaphor. IEEE Transactions on Systems, Man, and Cybernetics, SMC-11(1).
34. Landin, P. J. (1964) The mechanical evaluation of expressions. Computer Journal, 6, 308-320.
35. Lieberman, H. (1987) Concurrent object-oriented programming in act-1. In Yonezawa, A. and Tokoro, M. (eds.), Object-Oriented Concurrent Programming, pp. 9-36. MIT Press.
36. Manning, C. (1987) ACORE: The design of a core actor language and its compiler. Master's thesis, MIT, Artificial Intelligence Laboratory.
37. Mason, I. A. and Talcott, C. L. (1991) Equivalence in functional languages with effects. Journal of Functional Programming, 1, 287-327.
38. Mason, I. A. and Talcott, C. L. (1995) Reasoning about object systems in VTLOE. International Journal of Foundations of Computer Science 6(3), 265-298.
39. Meseguer, J. (1992). Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1), 73-155.
40. Milner, R. (1977) Fully abstract models of typed λ-calculi. Theoretical Computer Science, 4, 1-22.
41. Milner, R. (1983) Calculi for synchrony and asynchrony. Theoretical Computer Science, 25, 267-310.
42. Milner, R. (1989) Communication and Concurrency. Prentice Hall.
43. Milner, R., Parrow, J. G. and Walker, D. J. (1989) A calculus of mobile processes, Parts I and II. Technical Report ECS-LFCS-89-85, -86, Edinburgh University.
44. Moggi, E. (1988) Computational lambda-calculus and monads. Technical Report ECS-LFCS-88-86, University of Edinburgh.
45. Morris, J. H. (1968) Lambda calculus models of programming languages. PhD thesis, MIT.
46. Pierce, B. C. and Turner, D. N. (1994) Concurrent objects in a process calculus. In: Theory and Practice of Parallel Programming (TPPP), Sendai, Japan, Lecture Notes in Computer Science. Springer-Verlag. (To appear).
47. Plotkin, G. (1975) Call-by-name, call-by-value and the lambda calculus. Theoretical Computer Science, 1, 125-159.
48. Prasad, S., Giacalone, A. and Mishra, P. (1990) Operational and algebraic semantics for facile: A symmetric integration of concurrent and functional programming. In Paterson, M. S. (ed.), 17th International Colloquium on Automata, Languages and Programming: Lecture Notes in Computer Science 43, pp. 765-780. Springer-Verlag.
49. Reppy, J. H. (1991) An operational semantics of first-class synchronous operations. Technical Report TR 91-1232, Cornell University.
50. Sassone, V., Nielsen, M. and Winskel, G. (1993) A hierarchy of models for concurrency. 4th International Conference on Concurrency Theory (CONCUR '93): Lecture Notes in Computer Science. Springer-Verlag.
51. Steele, G. L. and Sussman, G. J. (1975) Scheme, an interpreter for extended lambda calculus. Technical Report Technical Report 349, Massachusetts Institute of Technology, Artificial Intelligence Laboratory.
52. Talcott, C. L. (1985) The essence of Rum: A theory of the intensional and extensional aspects of Lisp-type computation. PhD thesis, Stanford University.
53. Talcott, C. L. (1989) Programming and proving with function and control abstractions. Technical Report STAN-CS-89-1288, Stanford University Computer Science Department.
54. Talcott, C. L. (1991) Binding structures. In Lifschitz, V. (ed.), Artificial Intelligence and Mathematical Theory of Computation. Academic Press.
55. Talcott, C. L. (1993a) A theory for program and data specification. Theoretical Computer Science, 104, 129-159.
56. Talcott, C. L. (1993b) A theory of binding structures and its applications to rewriting. Theoretical Computer Science, 112, 99-143.
57. Thomsen, B., Leth, L. and Giacalone, A. (1992) Some issues in the semantics of Facile distributed programming. Technical Report ECRC-1992-32, European Computer-Industry Research Centre.
58. Tomlinson, C., Cannata, P., Meredith, G. and Woelk, D. (1993) The extensible services switch in carnot. IEEE Parallel and Distributed Technology: Systems and Applications, 1(2), 16-20.
59. Tomlinson, C., Kim, W., Schevel, M., Singh, V., Will, B. and Agha, G. (1989) Rosette: An object oriented concurrent system architecture. SIGPLAN Notices, 24(4), 91-93.
60. van Glabbeek, R. J. (1990) Comparative concurrency semantics and refinement of actions. PhD thesis, Free University of Amsterdam, Centre for Mathematics and Computer Science.
61. Yonezawa, A. (1990) ABCL: An Object-Oriented Concurrent System. MIT Press.