ABSTRACT
The PLANNER project is continuing research in natural and effective means for embedding knowledge in procedures. In the course of this work we have succeeded in unifying the formalism around one fundamental concept: the ACTOR. Intuitively, an ACTOR is an active agent which plays a role on cue according to a script. We use the ACTOR metaphor to emphasize the inseparability of control and data flow in our model. Data structures, functions, semaphores, monitors, ports, descriptions, Quillian nets, logical formulae, numbers, identifiers, demons, processes, contexts, and data bases can all be shown to be special cases of actors. All of the above are objects with certain useful modes of behavior. Our formalism shows how all of these modes of behavior can be defined in terms of one kind of behavior: sending messages to actors. An actor is always invoked uniformly in exactly the same way regardless of whether it behaves as a recursive function, data structure, or process.
- Balzer, R. M., "Ports--A Method for Dynamic Interporgam Communication and Job Control" The Rand Coporation. 1971.Google Scholar
- Bishop, Peter. "Data Types for Programming Generality" M.S. June 1972. M.I.T.Google Scholar
- Bobrow D., and Wegbriet Ben. "A Model and Stack Implementation of Multiple Environments. March 1973Google Scholar
- Burstall, R. M. "Proving Properties of Programs by Strucural Induction" Computer Journal Vol 12. pp. 41-48 (1969).Google ScholarCross Ref
- Courtois, P. J., Heymans, F. Parnass D. L. "Concurrent Control with 'READERS' and WRITERS'" Comm. ACM 14 10 pp667-668. Oct. 1971 Google ScholarDigital Library
- Daniels, Bruce. "Automatic Generation of Compilers from Interpreters". M.S. Forthcoming 1973.Google Scholar
- Davies, D. J. M. "POPLER: A POP-2 PLANNER" MIP-89. School of A-I. University of Edinburgh.Google Scholar
- Deutsch L. P. "An Interactive Program Verifier" Phd. University of California at Berkley. June 1973. Forthcoming.Google Scholar
- Earley, Jay. "Relational Level Data Structures for Programming Languages". March 1972.Google Scholar
- Elcock, E. W.; Foster, J. M.; Gray, P. M. D.; MacGregor, H. H.; and Murrary A. M. Abset, a Programming Language Based on Sets: Motivation and Example. Machine Intelligence 6. Edinburg University Press.Google Scholar
- Evans, A. E. "PAL--Pedagogic Algorithmic Language, A Reference Manual and Primer" Dept. of Electrical Engineering. M.I.T. 1970.Google Scholar
- Fisher, D. A. "Control Structures for Programming Languages" Phd. Carnegie. 1970 Google ScholarDigital Library
- Floyd R. W. "Assigning Meaning to Programs" Mathematical Aspects of Computer Science. J. T. Schwarts (ed.) Vol 19. Am. Math. Soc. pp. 19-32. Pro-idence Rhode Island 1967.Google Scholar
- Greif I. G. "Induction ti Proofs about Programs" Project MAC Technical Report 93. Feb, 1972. Google ScholarDigital Library
- Habermann A. N. "Synchronization of Communicating Processes" Comm. ACM 15 3 pp. 177-184. March 1970. Google ScholarDigital Library
- Hewitt, C. and Patterson M. "Comparative Schematology" Record of Project MAC Conference on Concurrent Systems and Parallel Computation. June 2-5, 1970. Available from ACM. Google ScholarDigital Library
- Hewit, C., Bishop P., and Steiger, R. "A Universal Modular ACTOR Formalism for Artificial Intelligence" PLANNER Technical Report 3. December 1972. Revised March 1973 and June 1973.Google Scholar
- Hewitt, C., Bishop P., and Steiger, R. "A Universal Modular Actor Formalism for Artificial Intelligence" IJCAI III. Stanford, Calif. Aug 1973 Forthcoming.Google Scholar
- Hoare, C. A. R. "An Axiomatic Definition of the Programming Language PASCAL" February 1972.Google Scholar
- Kay, Alan C. Private Communication.Google Scholar
- Krutar, R. "Conversational Systems Programming (or Program Plagiarism made Easy)" First USA-Japan Computer Conference. October 1972.Google Scholar
- Landin, P. J. "The Next 700 Programming Languages" Comm. ACM 9. (March, 1966). pp 790-793. Google ScholarDigital Library
- Manna, Z.; Ness, S.; Vuillemin J. "Inductive Methods for Proving Properties of Programs" Proceeding of an ACM Conference on Proving Assertions about Programs" January 1972. Google ScholarDigital Library
- McCarthy, J.; Abrahams, Paul W.; Edwards, Daniel J.; Hart, Timothy P.; and Levin, Michael I. "Lisp 1.5. Programmer's Manual, M.I.T. Press" Google ScholarDigital Library
- McCarthy, J. "Definitions of New Data Types in ALGOL X" ALGOL Bulletin. OCT. 1964. Google ScholarDigital Library
- Milner, R. Private communication.Google Scholar
- Mitchell, J. G. "A Unified Sequential Control Structure Model" NIC 16816. Forthcoming.Google Scholar
- Morris J. H. "Protection in Programming Languages" CACM. Jan, 1973. Google ScholarDigital Library
- Naur. P. "Proffs of Programs by General Snapshots" BIT. 1967.Google Scholar
- Newell, A.; Freeman P.; McCracken D.; and Robertson. G. "The Kernel Approach to Building Software Systems." Carneigie-Mellon University Computer Science Research Reviews. 1970-71.Google Scholar
- Park, D. "Fixpoint Induction and Proofs of Program Properties" Machine Intelligence 5. Edinburgh University Press. 1969.Google Scholar
- Patil, S. "Closure Properties of Interconnection of Determinate Systems" Project MAC Conference on Concurrent Systems and Parallel Processing. June 1970.Google Scholar
- Perlis, A. J. "The Syntesis of Algorithmic Systems" JACM. Jan 1967. Google ScholarDigital Library
- Reynolds, J. C. "GEDANKEN-A Simple Typeless Language Based on the Principle of Completeness and the Reference Concept" CACM, 1970. Google ScholarDigital Library
- Reynolds, J. C. "Definitional Interpreters for Higher-Order Programming Languages" Proceedings of ACM National Convention 1972. Google ScholarDigital Library
- Rulifson Johns F., Derksen J. A., and Waldinger R. J. "QA4: A Procedural Calculus for Intuitive Reasoning" Phd. Stanford. November 1972. Google ScholarDigital Library
- Scott, D. "Data Types as Lattices" Notes. Amsterdam, June 1972.Google Scholar
- Standish, T. "A Data Definition Facility for Programming Languages" Phd. Carnegie. 1967.Google Scholar
- Steiger, R. "Actors". M.S. 1973. Forthcoming.Google Scholar
- Waldinger R. Private Communication.Google Scholar
- Wang A. and Dahl O. "Coroutine Sequencing in a Blcok Structured Environment" BIT 11 425-449.Google ScholarDigital Library
- Weyhrauch, R. and Milner R. "Programming Semantics and Correctness in a Mechanized Logic." First USA-Japan Computer Conference. October 1972.Google Scholar
- Wulf W. and Shaw M. "Global Bariable Considered Harmful" Carnegie-Mellon University, Pittsburgh, PA. SIGPLAN Bulletin. 1973. Google ScholarDigital Library
- Actor induction and meta-evaluation
Recommendations
Modelling actor programs using Predicate/Transition nets
PDP '95: Proceedings of the 3rd Euromicro Workshop on Parallel and Distributed ProcessingThe actor model is a model of concurrent computation which is powerful enough to represent all the operations needed to exploit parallel and distributed machines. In this paper, we propose to model actor programs with Predicate/Transition nets. ...
A Hybrid Approach to Actor-Actor Connectivity Restoration in Wireless Sensor and Actor Networks
ICN '09: Proceedings of the 2009 Eighth International Conference on NetworksWireless sensor and actor networks (WSANs) consist of powerful actors and resource constraint sensors, which are linked together in wireless networks. In some applications, actors must communicate with each other to make appropriate decisions and ...
Composable Actor Behaviour
Distributed Applications and Interoperable SystemsAbstractCode reusability is the cornerstone of object-oriented programming. Reuse mechanisms such as inheritance and trait composition lay at the basis of a whole range of software engineering practices with the goal to improve software quality and ...
Comments