A programming language

@inproceedings{Iverson1962APL,
  title={A programming language},
  author={Kenneth E. Iverson},
  booktitle={AIEE-IRE '62 (Spring)},
  year={1962}
}
  • K. Iverson
  • Published in AIEE-IRE '62 (Spring) 30 December 1899
  • Computer Science
The paper describes a succinct problem-oriented programming language. The language is broad in scope, having been developed for, and applied effectively in, such diverse areas as microprogramming, switching theory, operations research, information retrieval, sorting theory, structure of compilers, search procedures, and language translation. The language permits a high degree of useful formalism. It relies heavily on a systematic extension of a small set of basic operations to vectors, matrices… 

Figures from this paper

The design of a procedureless programming language
  • C. Goldsmith
  • Computer Science
    SIGPLAN Symposium on Very High Level Languages
  • 1974
TLDR
A specific procedureless programming language that requires no ordering of the source program, which includes primitives for performing calculations on sets and a discussion of the usefulness of the language for a typical programming application.
An ALGOL-like computer design language
  • Y. Chu
  • Computer Science
    CACM
  • 1965
The idea of constructing a computer design language by making use of an ALGOL-like programming language is presented. A computer designer can benefit from using a design language at a higher level
A language design for vector machines
  • V. Basili, J. Knight
  • Computer Science
    Programming Languages and Compilers for Parallel and Vector Machines
  • 1975
TLDR
This paper deals with a programming language under development at NASA's Langley Research Center for the CDC STAR-100, capable of the expression of efficient algorithms by forcing the user to make the maximum use of the specialized hardware design, and easy to implement so that the language and compiler could be developed with a minimum of effort.
A common language for hardware, software, and applications
TLDR
This chapter discusses algorithms used in automatic data processing which are normally made amenable to human comprehension and analysis by expressing them in a more compact and abstract form which suppresses systematic detail.
An array language for data parallelism: Definition, compilation, and applications
TLDR
This work proposes an array language that captures many of the abstractions that are necessary for the effective programming of SIMD machines, thereby liberating the user from having to specify low-level details, and allows for efficient compilation using state-of-the-art techniques, achieving hand-code quality.
Using logic programming for compiling APL
TLDR
The intention thus far has been to demonstrate techniques for dealing with some of the issues that arise when trying to implement APL efficiently, rather than to produce a working implementation.
Control structures for programming languages
TLDR
This dissertation attempts to demonstrate the thesis: complexity diminishes and clarity increases to a marked degree if algorithms are described in a language in which appropriate control structures are primitive or easily expressible.
Dynamic algebra
TLDR
A language or set of languages, called dynamic algebras, which will simplify programming and provide the capability of simplifying programs are proposed, resulting in fewer but larger statements, rather than smaller, explicitly sequenced assignments and transfer.
A programming language for vector computers
TLDR
This thesis proposes a simple language construct allowing the explicit specification of independence and thus the parallel execution of statements in Oberon-V, which improves the readability and security of programs without reducing the quality of the generated code.
Vector Pascal, an array language
TLDR
Vector Pascal is a language designed to support elegant and efficient expression of algorithms using the SIMD model of computation and extends all operators to work on vectors of data.
...
...

References

SHOWING 1-6 OF 6 REFERENCES
A method for the construction of minimum-redundancy codes
  • D. Huffman
  • Computer Science, Business
    Proceedings of the IRE
  • 1952
TLDR
A minimum-redundancy code is one constructed in such a way that the average number of coding digits per message is minimized.
Sorting on Electronic Computer Systems
Ar i s to t l e ' s Syllogistic F r o m the Standpoint of Modern F o r m a l Logic, Clarendon P r e s s
  • 1951