skip to main content
10.1145/512927.512942acmconferencesArticle/Chapter ViewAbstractPublication PagespoplConference Proceedingsconference-collections
Article
Free Access

Actor induction and meta-evaluation

Published:01 October 1973Publication History

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.Google ScholarGoogle Scholar
  2. Bishop, Peter. "Data Types for Programming Generality" M.S. June 1972. M.I.T.Google ScholarGoogle Scholar
  3. Bobrow D., and Wegbriet Ben. "A Model and Stack Implementation of Multiple Environments. March 1973Google ScholarGoogle Scholar
  4. Burstall, R. M. "Proving Properties of Programs by Strucural Induction" Computer Journal Vol 12. pp. 41-48 (1969).Google ScholarGoogle ScholarCross RefCross Ref
  5. Courtois, P. J., Heymans, F. Parnass D. L. "Concurrent Control with 'READERS' and WRITERS'" Comm. ACM 14 10 pp667-668. Oct. 1971 Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Daniels, Bruce. "Automatic Generation of Compilers from Interpreters". M.S. Forthcoming 1973.Google ScholarGoogle Scholar
  7. Davies, D. J. M. "POPLER: A POP-2 PLANNER" MIP-89. School of A-I. University of Edinburgh.Google ScholarGoogle Scholar
  8. Deutsch L. P. "An Interactive Program Verifier" Phd. University of California at Berkley. June 1973. Forthcoming.Google ScholarGoogle Scholar
  9. Earley, Jay. "Relational Level Data Structures for Programming Languages". March 1972.Google ScholarGoogle Scholar
  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.Google ScholarGoogle Scholar
  11. Evans, A. E. "PAL--Pedagogic Algorithmic Language, A Reference Manual and Primer" Dept. of Electrical Engineering. M.I.T. 1970.Google ScholarGoogle Scholar
  12. Fisher, D. A. "Control Structures for Programming Languages" Phd. Carnegie. 1970 Google ScholarGoogle ScholarDigital LibraryDigital Library
  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.Google ScholarGoogle Scholar
  14. Greif I. G. "Induction ti Proofs about Programs" Project MAC Technical Report 93. Feb, 1972. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Habermann A. N. "Synchronization of Communicating Processes" Comm. ACM 15 3 pp. 177-184. March 1970. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  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.Google ScholarGoogle Scholar
  18. Hewitt, C., Bishop P., and Steiger, R. "A Universal Modular Actor Formalism for Artificial Intelligence" IJCAI III. Stanford, Calif. Aug 1973 Forthcoming.Google ScholarGoogle Scholar
  19. Hoare, C. A. R. "An Axiomatic Definition of the Programming Language PASCAL" February 1972.Google ScholarGoogle Scholar
  20. Kay, Alan C. Private Communication.Google ScholarGoogle Scholar
  21. Krutar, R. "Conversational Systems Programming (or Program Plagiarism made Easy)" First USA-Japan Computer Conference. October 1972.Google ScholarGoogle Scholar
  22. Landin, P. J. "The Next 700 Programming Languages" Comm. ACM 9. (March, 1966). pp 790-793. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  24. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  25. McCarthy, J. "Definitions of New Data Types in ALGOL X" ALGOL Bulletin. OCT. 1964. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Milner, R. Private communication.Google ScholarGoogle Scholar
  27. Mitchell, J. G. "A Unified Sequential Control Structure Model" NIC 16816. Forthcoming.Google ScholarGoogle Scholar
  28. Morris J. H. "Protection in Programming Languages" CACM. Jan, 1973. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Naur. P. "Proffs of Programs by General Snapshots" BIT. 1967.Google ScholarGoogle Scholar
  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.Google ScholarGoogle Scholar
  31. Park, D. "Fixpoint Induction and Proofs of Program Properties" Machine Intelligence 5. Edinburgh University Press. 1969.Google ScholarGoogle Scholar
  32. Patil, S. "Closure Properties of Interconnection of Determinate Systems" Project MAC Conference on Concurrent Systems and Parallel Processing. June 1970.Google ScholarGoogle Scholar
  33. Perlis, A. J. "The Syntesis of Algorithmic Systems" JACM. Jan 1967. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Reynolds, J. C. "GEDANKEN-A Simple Typeless Language Based on the Principle of Completeness and the Reference Concept" CACM, 1970. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Reynolds, J. C. "Definitional Interpreters for Higher-Order Programming Languages" Proceedings of ACM National Convention 1972. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Rulifson Johns F., Derksen J. A., and Waldinger R. J. "QA4: A Procedural Calculus for Intuitive Reasoning" Phd. Stanford. November 1972. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Scott, D. "Data Types as Lattices" Notes. Amsterdam, June 1972.Google ScholarGoogle Scholar
  38. Standish, T. "A Data Definition Facility for Programming Languages" Phd. Carnegie. 1967.Google ScholarGoogle Scholar
  39. Steiger, R. "Actors". M.S. 1973. Forthcoming.Google ScholarGoogle Scholar
  40. Waldinger R. Private Communication.Google ScholarGoogle Scholar
  41. Wang A. and Dahl O. "Coroutine Sequencing in a Blcok Structured Environment" BIT 11 425-449.Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. Weyhrauch, R. and Milner R. "Programming Semantics and Correctness in a Mechanized Logic." First USA-Japan Computer Conference. October 1972.Google ScholarGoogle Scholar
  43. Wulf W. and Shaw M. "Global Bariable Considered Harmful" Carnegie-Mellon University, Pittsburgh, PA. SIGPLAN Bulletin. 1973. Google ScholarGoogle ScholarDigital LibraryDigital Library
  1. Actor induction and meta-evaluation

    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
    • Published in

      cover image ACM Conferences
      POPL '73: Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
      October 1973
      242 pages
      ISBN:9781450373494
      DOI:10.1145/512927

      Copyright © 1973 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 October 1973

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      POPL '73 Paper Acceptance Rate22of100submissions,22%Overall Acceptance Rate824of4,130submissions,20%

      Upcoming Conference

      POPL '25

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader