STDS(ID:6536/std001)

Set based language 

for Set-Theoretic Data Structure
References:
  • Childs, D.L., "Description of a Set-Theoretic Data Structure" view details
          in [AFIPS] Proceedings of the 1968 Fall Joint Computer Conference FJCC 33 view details
  • Childs, D.L., Description of a Set-Theoretic Data Structure, Technical Report 3, Concomp Project, University of Michigan, Ann Arbor, March 1968 view details
          in [AFIPS] Proceedings of the 1968 Fall Joint Computer Conference FJCC 33 view details
  • Codd, E.F. "A database sublanguage founded on the relational calculus" pp35-68 view details
          in [ACM] Proceedings on the ACM SIGFIDET Workshop on Data Description, Access, and Control, San Diego, California (November 1971) view details
  • Leavenworth, Burt M.; Sammet, Jean E. "An overview of nonprocedural languages" pp1-12 view details Abstract: 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.

          in Proceedings of the ACM SIGPLAN symposium on Very high level languages, March 28-29, 1974, Santa Monica, California, United States view details