Actor induction and meta-evaluation

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.

REFERENCES

• 1: Balzer, R. M., "Ports--A Method for Dynamic Interporgam Communication and Job Control" The Rand Coporation. 1971.
• 2: Bishop, Peter. "Data Types for Programming Generality" M.S. June 1972. M.I.T.
• 3: Bobrow D., and Wegbriet Ben. "A Model and Stack Implementation of Multiple Environments. March 1973
• 4: Burstall, R. M. "Proving Properties of Programs by Strucural Induction" Computer Journal Vol 12. pp. 41-48 (1969).
• 5: P. J. Courtois , F. Heymans , D. L. Parnas, Concurrent control with “readers” and “writers”, Communications of the ACM, v.14 n.10, p.667-668, Oct. 1971 [doi>10.1145/362759.362813]
• 6: Daniels, Bruce. "Automatic Generation of Compilers from Interpreters". M.S. Forthcoming 1973.
• 7: Davies, D. J. M. "POPLER: A POP-2 PLANNER" MIP-89. School of A-I. University of Edinburgh.
• 8: Deutsch L. P. "An Interactive Program Verifier" Phd. University of California at Berkley. June 1973. Forthcoming.
• 9: Earley, Jay. "Relational Level Data Structures for Programming Languages". March 1972.
• 10: 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.
• 11: Evans, A. E. "PAL--Pedagogic Algorithmic Language, A Reference Manual and Primer" Dept. of Electrical Engineering. M.I.T. 1970.
• 12: David Allen Fisher, Control structures for programming languages, 1970
• 13: 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.
• 14: I. Greif, INDUCTION IN PROOFS ABOUT PROGRAMS, Massachusetts Institute of Technology, Cambridge, MA, 1972
• 15: A. Nico Habermann, Synchronization of communicating processes, Communications of the ACM, v.15 n.3, p.171-176, March 1972 [doi>10.1145/361268.361277]
• 16: Michael S. Paterson , Carl E. Hewitt, Comparative Schematology, Massachusetts Institute of Technology, Cambridge, MA, 1970
• 17: 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.
• 18: Hewitt, C., Bishop P., and Steiger, R. "A Universal Modular Actor Formalism for Artificial Intelligence" IJCAI III. Stanford, Calif. Aug 1973 Forthcoming.
• 19: Hoare, C. A. R. "An Axiomatic Definition of the Programming Language PASCAL" February 1972.
• 20: Kay, Alan C. Private Communication.
• 21: Krutar, R. "Conversational Systems Programming (or Program Plagiarism made Easy)" First USA-Japan Computer Conference. October 1972.
• 22: P. J. Landin, The next 700 programming languages, Communications of the ACM, v.9 n.3, p.157-166, March 1966 [doi>10.1145/365230.365257]
• 23: Zohar Manna , Stephen Ness , Jean Vuillemin, Inductive methods for proving properties of programs, Proceedings of ACM conference on Proving assertions about programs, p.27-50, January 06-07, 1972, Las Cruces, New Mexico, United States
• 24: John McCarthy, LISP 1.5 Programmer's Manual, The MIT Press, 1962
• 25: J. McCarthy, Definition of new data types in ALGOL x, ALGOL Bulletin [doi>10.1145/1060978.1060993]
• 26: Milner, R. Private communication.
• 27: Mitchell, J. G. "A Unified Sequential Control Structure Model" NIC 16816. Forthcoming.
• 28: James H. Morris, Jr., Protection in programming languages, Communications of the ACM, v.16 n.1, p.15-21, Jan. 1973 [doi>10.1145/361932.361937]
• 29: Naur. P. "Proffs of Programs by General Snapshots" BIT. 1967.
• 30: 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.
• 31: Park, D. "Fixpoint Induction and Proofs of Program Properties" Machine Intelligence 5. Edinburgh University Press. 1969.
• 32: Patil, S. "Closure Properties of Interconnection of Determinate Systems" Project MAC Conference on Concurrent Systems and Parallel Processing. June 1970.
• 33: Alan J. Perlis, The Synthesis of Algorithmic Systems, Journal of the ACM (JACM), v.14 n.1, p.1-9, Jan. 1967 [doi>10.1145/321371.321372]
• 34: John C. Reynolds, G/EDANKEN—a simple typeless language based on the principle of completeness and the reference concept, Communications of the ACM, v.13 n.5, p.308-319, May 1970 [doi>10.1145/362349.362364]
• 35: John C. Reynolds, Definitional interpreters for higher-order programming languages, Proceedings of the ACM annual conference, p.717-740, August 01-01, 1972, Boston, Massachusetts, United States [doi>10.1145/800194.805852]
• 36: Johns Frederick Rulifson, Language-qa4: a procedural calculus for intuitive reasoning., 1973
• 37: Scott, D. "Data Types as Lattices" Notes. Amsterdam, June 1972.
• 38: Standish, T. "A Data Definition Facility for Programming Languages" Phd. Carnegie. 1967.
• 39: Steiger, R. "Actors". M.S. 1973. Forthcoming.
• 40: Waldinger R. Private Communication.
• 41: Wang A. and Dahl O. "Coroutine Sequencing in a Blcok Structured Environment" BIT 11 425-449.
• 42: Weyhrauch, R. and Milner R. "Programming Semantics and Correctness in a Mechanized Logic." First USA-Japan Computer Conference. October 1972.
• 43: W. Wulf , Mary Shaw, Global variable considered harmful, ACM SIGPLAN Notices, v.8 n.2, p.28-34, February 1973 [doi>10.1145/953353.953355]