The nested rectangular array as a model of data

Data, like electricity and gravity, are part of the world in which we live. Some occur naturally, as in the genetic code, while most occur as a consequence of language and social organization. The search for a theory of data, which begins with the choice of a model, is as important and interesting as the development of theories in physics, economics, and psychology. Most models of data are collections, such as the unnested array of APL, the one-axis nested list of LISP, and the set, which is nested but lacks the properties of order, repetitions, type, and multiple axes inherent in rectangular arrangement. Nested rectangular arrays have all these properties. The existence of simple, universally valid equations in both set theory and linear algebra suggests that equally simple equations may hold for all arrays. The principles of nested collections developed in set theory apply with few changes to the nesting of arrays. A one-sorted theory of arrays, in which type is preserved for empty arrays, provides an algebra of operations interpreted not only for data but also types of data.

[1]  Willard Van Orman Quine,et al.  New Foundations for Mathematical Logic , 1937 .

[2]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[3]  R. G. Cooke,et al.  Abstract Set Theory , 1954, Nature.

[4]  W. V. Quine,et al.  Unification of universes in set theory , 1956, Journal of Symbolic Logic.

[5]  Th. Skolem,et al.  Two remarks on set theory , 1957 .

[6]  John McCarthy,et al.  Recursive functions of symbolic expressions and their computation by machine, Part I , 1960, Commun. ACM.

[7]  Martha Kneale,et al.  The development of logic , 1963 .

[8]  Lectures on tensor calculus and differential geometry , 1964 .

[9]  Kenneth E. Iverson,et al.  A Formal Description of SYSTEM/360 , 1964, IBM Syst. J..

[10]  Martin Davis,et al.  The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions , 2004 .

[11]  P. J. Cohen Set Theory and the Continuum Hypothesis , 1966 .

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

[13]  D. L. Childs Feasibility of a set-theoretic data structure. A general structure based on a reconstituted definition of relation , 1968, IFIP Congress.

[14]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[15]  A. Phillips The macmillan company. , 1970, Analytical chemistry.

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

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

[18]  Trenchard More,et al.  Axioms and Theorems for a Theory of Arrays , 1973, IBM J. Res. Dev..

[19]  Ken Kennedy,et al.  An introduction to the set theoretical language SETL , 1975 .

[20]  A. D. Falkoff,et al.  The design of APL , 1973, APLQ.

[21]  H. S. Warren Definition of the concept “vector” in set theoretic programming languages , 1976 .

[22]  Dana S. Scott,et al.  Data Types as Lattices , 1976, SIAM J. Comput..

[23]  Donald D. Chamberlin,et al.  SEQUEL 2: A Unified Approach to Data Definition, Manipulation, and Control , 1976, IBM J. Res. Dev..

[24]  Benjamin Kuipers,et al.  Computer power and human reason , 1976, SGAR.

[25]  David Childs Extended set theory: general model for very large, distributed, backend information systems , 1977 .

[26]  John W. Backus,et al.  Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs , 1978, CACM.

[27]  Shmuel Winograd,et al.  Complexity Of Computations , 1978, ACM Annual Conference.

[28]  D. Schmandt-Besserat The Earliest Precursor of Writing , 1978, Communication in History.

[29]  K. Iverson The role of operators in APL , 1979, APL '79.

[30]  Michael A. Jenkins,et al.  Decisions for "type" in APL , 1979, POPL '79.

[31]  Robert Cartwright,et al.  First order programming logic , 1979, POPL.

[33]  A. Hassitt,et al.  Array theory in an APL environment , 1979, APL '79.