{"type":"ScholarlyArticle","title":"A Model for Control Structures for Artificial Intelligence Programming Languages","authors":[{"name":"Daniel G. Bobrow","slug":"daniel-g-bobrow","given":"Daniel G.","family":"Bobrow","affiliation":"Computer Science Division Xerox Palo Alto Research Center Palo Alto , California 94 304"}],"abstract":"Newer programming languages for artificial intelligence extend the class of available control regimes beyond simple hierarchical control. In so doing, a key issue is using a model that clearly exhibits the relation between modules, processes, access environments, and control environments. This paper presents a model which is applicable to diverse languages and presents a set of control primitives which provide a concise basis on which one can define almost all known regimes of control.","doi":null,"url":"https://ijcai.org/proceedings/1973/32","pdf":"https://ijcai.org/proceedings/1973/0032.pdf","markdown":"https://ijcai.org/proceedings/1973/32.md","bibtex":"https://ijcai.org/proceedings/1973/bibtex/32","volume":{"slug":"1973","title":"Proceedings of the Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1973","url":"https://ijcai.org/proceedings/1973/","year":1973,"location":"Stanford, California, USA","dates":"20-23 August 1973","editors":"Nils J. Nilsson","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Formalisms for A.I.","track":"Formalisms for A.I.","number":32,"pages":{"first":246,"last":253},"keywords":[],"videos":[],"references":[{"position":1,"raw":"Bobrow, D. G. , \"Requirements for Advanced Programming Systems for List Processing,\" CACM, Vol. 15, No. 6, June 1972.","title":"Requirements for Advanced Programming Systems for List Processing","authors":"D G Bobrow","year":"1972","venue":"CACM","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"Bobrow, D. G . and Wegbreit, B. \"A Model and Stack Implementation of Multiple Environ- ments ,\" BBN Report No. 2334, Cambridge, Mass., March 1972, to appear in CACM .","title":"A Model and Stack Implementation of Multiple Environments","authors":"D G Bobrow, B Wegbreit","year":"1972","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"Burge, W. H. \"Some Examples of the Use of Function Producing Functions,\" Second Sym- posium on Symbolic and Algebraic Manipu- lation, ACM, 1971.","title":"Some Examples of the Use of Function Producing Functions","authors":"W H Burge","year":"1971","venue":"Second Symposium on Symbolic and Algebraic Manipulation","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"Dijkstra, E. W . \"Co-operating Sequential Pro- cesses ,\" in Genuys (Ed.), Programming Languages, Academic Press, 1967.","title":"Co-operating Sequential Processes","authors":"E W Dijkstra","year":"1967","venue":"Programming Languages","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"Dijkstra, E. W. \"Recursive Programming,\" Numerische Mathematik 2 (1960), 312-318. Also in Programming Systems and Languages, S. Rosen (Ed.), McGraw-Hill , New York, 1967.","title":"Recursive Programming","authors":"E W Dijkstra","year":"1960","venue":"Numerische Mathematik","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"Fenichel, R. \"On Implementation of Label Vari- ables,\" CACM, Vol. 14, No . 5 (May 1971), pp. 349 -350 .","title":"On Implementation of Label Variables","authors":"R Fenichel","year":"1971","venue":"CACM","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"Floyd, R. W. \"Non-deterministic Algorithms,\" I_. ACM, 14 (October 1967), pp. 636-644.","title":"Non-deterministic Algorithms","authors":"R W Floyd","year":"1967","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"Golomb, S . W. and Baumert, L.D. \"Backtrack Programming,\" J. ACM, 12 (October 19 65), pp. 516-524.","title":"Backtrack Programming","authors":"S W Golomb, L D Baumert","year":"1965","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"Hewitt, C . \"PLANNER: A Language forManipu- lating Models and Proving Theorems in a Robot,\" in Artificial Intelligence, Washington, D. C . , May 1969.","title":"PLANNER: A Language forManipulating Models and Proving Theorems in a Robot","authors":"C Hewitt","year":"1969","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"Johnston, J . B. \"The Contour Model of Block Structured Processes,\" in Tou and Wegner, Proc. Symposium on Data Structures in Programming Languages, SIGPLAN Noti c es, Vol. 6, No . 2, pp. 55-82 .","title":"The Contour Model of Block Structured Processes","authors":"J B Johnston","year":null,"venue":"Tou and Wegner, Proc. Symposium on Data Structures in Programming Languages, SIGPLAN Noti c es","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"McCarthy, J ., et al. Lisp hi Programmer's Manual, ThelVI.I. T. Press, Cambridge, Massachusetts (1962).","title":"Lisp hi Programmer's Manual","authors":"J Mccarthy","year":"1962","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"Moses, J. \"The Function of FUNCTION in LISP,\" SIGSAM Bulletin, No. 15, (July 1970), pp. 13-27.","title":"The Function of FUNCTION in LISP","authors":"J Moses","year":"1970","venue":"SIGSAM Bulletin","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"Prenner, C ., Spitzen, J. and Wegbreit, B. \"An Implementation of Backtracking for Pro- gramming Languages,\" submitted for publi- cation, ACM -7 2.","title":"An Implementation of Backtracking for Programming Languages","authors":"C Prenner, J Spitzen, B Wegbreit","year":null,"venue":"submitted for publication","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"Prenner, C. \"Multi-path Control Structures for Programming Languages,\" Ph.D. Thesis, Harvard University, May 1972.","title":"Multi-path Control Structures for Programming Languages","authors":"C Prenner","year":"1972","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"Quam, L. LISP 1. 6 Reference Manual, Stanford AI Laboratory.","title":"LISP 1. 6 Reference Manual","authors":"L Quam","year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"Reynolds, J. \"GEDANKEN-A Simple Typeless Language Based on the Principle of Complete- ness and the Reference Concept,\" CACM, Vol. 13, No. 5 (May 1970), pp. 308 -319.","title":"GEDANKEN-A Simple Typeless Language Based on the Principle of Completeness and the Reference Concept","authors":"J Reynolds","year":"1970","venue":"CACM","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"Rulifson, J. et al. \"QA4 -A Language for Writing Problem-Solving Programs,\" SRI Technical Note 48, November 1970 .","title":"QA4 -A Language for Writing Problem-Solving Programs","authors":"J Rulifson","year":"1970","venue":"SRI Technical Note","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"Sussman, G.J. \"Why Conniving is Better than Planning,\" FJCC 1972, pp. 1171-117 9 .","title":"Why Conniving is Better than Planning","authors":"G J Sussman","year":"1972","venue":"FJCC","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"Teitelman, W., Bobrow, D., Murphy, D., and Hartley, A. BBN-LISP Manual, BBN, July 197 1.","title":"BBN-LISP Manual","authors":"W Teitelman, D Bobrow, D Murphy, A Hartley","year":"1971","venue":"BBN","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"---- Tou, J. and Wegner, P. (Eds. ). SIGPLAN Notices -Proc. Symposium on Data Structures in Programming Languages, Vol. 6, No. 2 (February 1971).","title":"SIGPLAN Notices -Proc. Symposium on Data Structures in Programming Languages","authors":null,"year":"1971","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"van Wijngaarden, A. (Ed.). Report on the Algorithmic Language ALGOL 68, MR 101, Mathematisch Centrum, Amsterdam (February 1969).","title":"Report on the Algorithmic Language ALGOL 68","authors":null,"year":"1969","venue":"MR","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"Wegbreit, B . \"Studies in Extensible Program- ming Languages;' Ph. D. Thesis, Harvard University, May 1970.","title":"Studies in Extensible Programming Languages","authors":"B Wegbreit","year":"1970","venue":null,"doi":null,"url":null,"internal_url":null},{"position":23,"raw":"Wegbreit , B. \"The ECL Programming System,\" Proc. AFIPS 1971 FJCC, Vol. 39, AFIPS Press, Montvale, N.J., pp. 253-262.","title":"The ECL Programming System","authors":"B Wegbreit","year":null,"venue":"Proc. AFIPS 1971 FJCC","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"Wegner , P. \"Data Structure Models for Pro-0 gramming Languages,\" in Tou and Wegner~ pp . 55-82.","title":"Data Structure Models for Pro-0 gramming Languages","authors":"P Wegner","year":null,"venue":"Tou and Wegner~","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"Weizenbaum, J. \"The Funarg Problem Explained,\" M.I. T., Cambridge, Mass., March 1968.","title":"The Funarg Problem Explained","authors":"J Weizenbaum","year":"1968","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}