Programming with abstract data types

TL;DR: In this paper, the basic concepts for the theory of algebraic specifications are reviewed, and four other semantic concepts and algebras for specifying nondeterminism and concurrency are presented.

TL;DR: A new approach to knowledge representation where knowledge bases are characterized not in terms of the structures they use to represent knowledge, but functionally, in Terms of what they can be asked or told about some domain, which cleanly separates functionality from implementation structure.

TL;DR: In this article, three language constructs for the extension of high level languages by data types of mode relations are proposed and discussed: a repetition statement controlled by relations, predicates as a generalization of Boolean expressions, and a constructor for relations using predicates.

TL;DR: Techniques for obtaining a fault-tolerant implementation from a non-distributed specification and for achieving improved performance by concurrently updating replicated data are discussed.

TL;DR: A notation and formalism is presented which could be part of a programming language, which allows a programmer who has expressed the semantics of an algorithm in terms of the graphs to then specify the implementation of some of his data structures in order to gain efficiency.

TL;DR: This paper focuses on the decomposition of the system into components or modules which make as few assumptions as possible about the other components, so that subsequent maintenance and extensions can be done with a smaller probability of introducing errors.

TL;DR: Pascal was developed on the basis of Algol 60 with emphasis placed on keeping the number of fundamental concepts reasonably small, on a simple and systematic language structure, and on efficient implementability.