The design of a procedureless programming language

  • Authors:
  • Clair W. Goldsmith

  • Affiliations:
  • -

  • Venue:
  • Proceedings of the ACM SIGPLAN symposium on Very high level languages
  • Year:
  • 1974

Quantified Score

Hi-index 0.03

Visualization

Abstract

The programming of digital computers has been a major concern of mainframe manufacturers, academicians, computer users and software product manufacturers since the first marketable computers were produced. Most often, the machine execution order has been explicit at the level at which the machine is programmed. This paper takes as a premise that source statement ordering does not have to describe machine execution order. It describes a specific procedureless programming language that requires no ordering of the source program. This language includes primitives for performing calculations on sets. In this language statements are not executable. They are rules for defining sets. The paper concludes with a discussion of the usefulness of the language for a typical programming application.