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
FUNCTORIAL HIERARCHIES OF FUNCTIONAL LANGUAGES.
Abstract
For any set SIGMA of operation symbols we present both a concrete and and abstract development of a hierarchy L// SIGMA //,//0, L// SIGMA //,//1, L// SIGMA //,//2, . . . L// SIGMA //,//n, . . . of functional programming languages employing the elements of SIGMA as primitives. Each step in the hierarchy introduces 'function variables' (selector functions) of the next higher type. We include a basis for an operational semantics for these languages given any interpretation of the operation symbols. The main result is an abstract algebraic characterization of these languages in terms of a new kind of algebraic theory, together with a sketch of the proof that the concrete and abstract presentations are equivalent.