An overview of nonprocedural languages

This paper attempts to describe some of the basic characteristics and issues involving the class of programming languages commonly referred to as “nonprocedural” or “very high level”. The paper discusses major issues such as terminology, relativeness, and arbitrary sequencing. Five features of nonprocedural languages are described, and a number of specific languages are discussed briefly. A short history of the subject is included.

[1]  David L. Childs.  Description of a set-theoretic data structure , 1968, AFIPS '68 (Fall, part I).

[2]  William C. McGee,et al.  An experiment in non-procedural programming , 1963, AFIPS '63 (Fall).

[3]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[4]  Daniel Teichroew,et al.  A survey of languages for stating requirements for computer-based information systems , 1972, AFIPS '72 (Fall, part II).

[5]  Carl Hewitt,et al.  PLANNER: A Language for Proving Theorems in Robots , 1969, IJCAI.

[6]  Thomas E. Cheatham,et al.  A laboratory for the study of automating programming , 1971, AFIPS '72 (Spring).

[7]  Richard Fikes,et al.  REF-ARF: A System for Solving Problems Stated as Procedures , 1970, Artif. Intell..

[8]  Alois Strnad.  The Relational Approach to the Management of Data Bases , 1971, IFIP Congress.

[9]  A. Haller,et al.  Automatic Program Analysis , 1974 .

[10]  John A. Gosden,et al.  Explicit parallel processing description and control in programs for multi- and uni-processor computers , 1899, AFIPS '66 (Fall).

[11]  Jean E. Sammet,et al.  An overview of programming languages for specialized application areas , 1972, AFIPS '72 (Spring).

[12]  Jr. Harry Earl Pople,et al.  A goal-oriented language for the computer , 1969 .

[13]  Carl Hewitt,et al.  Procedural Embedding of knowledge in Planner , 1971, IJCAI.

[14]  Drew McDermott,et al.  From PLANNER to CONNIVER: a genetic approach , 1972, AFIPS '72 (Fall, part II).

[15]  Robert Balzer.  Dataless programming , 1967, AFIPS '67 (Fall).

[16]  Jerome A. Feldman,et al.  Recent developments in SAIL: an ALGOL-based language for artificial intelligence , 1972, AFIPS '72 (Fall, part II).

[17]  James P. Anderson.  A computer for direct execution of algorithmic languages , 1961, AFIPS '61 (Eastern).

[18]  David Allen Fisher,et al.  Control structures for programming languages , 1970 .

[19]  Eugene D. Homer.  An algorithm for selecting and sequencing statements as a basis for a problem-oriented programming system , 1966, ACM '66.

[20]  Gerald Jay Sussman,et al.  Micro-Planner Reference Manual , 1970 .

[21]  Saul Aaron Volansky,et al.  Graph model analysis and implementation of computational sequences , 1970 .

[22]  J. B. Morris,et al.  SPECIFICATION OF PROGRAM FLOW IN MADCAP VI. , 1971 .

[23]  P. J. Landin,et al.  The next 700 programming languages , 1966, CACM.

[24]  Solomon W. Golomb,et al.  Backtrack Programming , 1965, JACM.

[25]  Richard J. Waldinger,et al.  The QA4 language applied to robot planning , 1972, AFIPS '72 (Fall, part II).

[26]  James P. Anderson,et al.  Program structures for parallel processing , 1965, Commun. ACM.

[27]  Richard C. T. Lee,et al.  PROW: A Step Toward Automatic Program Writing , 1969, IJCAI.

[28]  Robert W. Floyd,et al.  Nondeterministic Algorithms , 1967, JACM.

[29]  Melvin E. Conway,et al.  Design of a separable transition-diagram compiler , 1963, CACM.

[30]  Jean E. Sammet.  Problems in, and a pragmatic approach to, programming language measurement , 1972, AFIPS '71 (Fall).

[31]  David Canfield Smith,et al.  The LISP7O Pattern Matching System , 1973, IJCAI.

[32]  L. G. Tesler,et al.  A language design for concurrent processes , 1899, AFIPS Spring Joint Computing Conference.

[33]  S. Schlesinger,et al.  POSE: a language for posing problems to a computer , 1967, CACM.

[34]  Edgar H. Sibley,et al.  Tramp: An interpretive associative processor with deductive capabilities , 1968, ACM National Conference.

[35]  Bruce G. Buchanan,et al.  On generality and problem solving: a case study using the DENDRAL program , 1970 .

[36]  E. F. Codd,et al.  Relational Completeness of Data Base Sublanguages , 1972, Research Report / RJ / IBM / San Jose, California.

[37]  J. Daniel Couger,et al.  Evolution of Business System Analysis Techniques , 1973, CSUR.

[38]  Kristen Nygaard,et al.  SIMULA: an ALGOL-based simulation language , 1966, CACM.

[39]  Isamu Kobayashi.  An algebraic model of information structure and information processing , 1972, ACM '72.

[40]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[41]  Ascher Opler,et al.  Procedure-oriented language statements to facilitate parallel processing , 1965, CACM.

[42]  E. F. Codd,et al.  A data base sublanguage founded on the relational calculus , 1971, SIGFIDET '71.

[43]  F. J. Sansom,et al.  The SCi Continuous System Simulation Language (CSSL) , 1967 .

[44]  Zohar Manna,et al.  Towards automatic program synthesis , 1971, Symposium on Semantics of Algorithmic Languages.

[45]  John W. Young,et al.  An abstract formulation of data processing problems , 1958, ACM '58.

[46]  Patricia C. Goldberg,et al.  Automatic Programming , 1974, Programming Methodology.

[47]  Jerome A. Feldman,et al.  An ALGOL-based associative language , 1969, CACM.