A familial specification language for database application systems

  • Authors:
  • Levent Orman

  • Affiliations:
  • Cornell University, Graduate School of Management, Ithaca, NY 14853, U.S.A.

  • Venue:
  • Computer Languages
  • Year:
  • 1983

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Familial Specification Language is a set theoretic and functional language providing a unified approach to the less-procedural design of database application systems. The language is proposed to be both a database language and an application program specification language. The unique data structure employed, the family of sets, provides the designer with a unified framework, both to model and maintain data, and to algebraically specify the application programs without looping or branching, and with no side effects. Using the same data structure in both the data model and the problem specification creates a natural interface between the database and the application programs. Special emphasis is placed on aggregation and classification, the major problems is business data processing.