About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Conference paper
From algebras to programming languages
Abstract
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 con-structions are algebraic in the sense that they are constructions on algebras which yield new algebras. However, for the sake of comprehensi-bility, 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].