Ten Mini-Languages: A Study of Topical Issues in Programming Languages
ACM Computing Surveys (CSUR)
An algebraic theory of recursive definitions and recursive languages
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Inductive methods for proving properties of programs
Proceedings of ACM conference on Proving assertions about programs
On the theory of programming logics
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
On homomorphisms, correctness, termination, unfoldments, equivalence of flow diagram programs
Journal of Computer and System Sciences
| Hi-index | 0.00 |
This paper gives an informal presentation of constructions which, when combined, enable one to construct high level programming languages from algebras or, equivalently, from collections of primitive operations on some set (e.g. from the arithmetic, vector and logical operations on the set of integers, integer vectors, and truth values). Using this approach one can construct languages with block structure, procedures, procedure calls by both name and value, plus essentially simpler concepts such as assignment statements and conditional transfers. The constructions are algebraic in the sense that they are constructions on algebras which yield new algebras. However, for the sake of comprehensibility, we present them in this paper in a more informal manner as constructions on “black boxes”. This paper is a continuation of work presented earlier in [3] and [4] and owes much to the joint work to be reported in [5].