Algebras with approximation and recursive data structures

From MaRDI portal





The author evolves algebraic tools to formalize subject area models based on the combination of the apparatus of abstract data types (ADT) and the approximation theory (D. Scott's continuous lattices [cf. \textit{D. J. Lehmann} and \textit{M. B. Smyth}, ``Data types, 18th Ann. IEEE Symp. Found. Comput. Sci., 7-12 (1977)] or Yu. L. Ershov's A-spaces [cf. \textit{A. Kanda}, ``Data types as initial algebras: a unification of Scottery and ADJery, 19th Ann. IEEE Symp. Found. Comput. Sci., 221-230 (1978)]). The subject area model is considered as the combination of a basic many- based algebra of data and an algebra of data structures over it (superstructure). ADTs are the components of the basic algebra. The predicates, as well as the operations, may be defined on the named components. Therefore, we can speak about the basic algebraic system or about the algebra with relations. Along with functional and set-theoretical superstructures the particular attention is payed to the construction of a recursive one, which operates with lists, trees, graphs, frame and network data structures, treating them up to various relationships induced by the basic algebra. Various combinations of three superstructures lead to multilevel data structures. Among the main results of the performed investigation there is the generalization of a number of the known constructs in the theory of recursive data structures. It is important to emphasize that the developed algebraic approach offers a means of transforming the objects in the construction of computational procedures (program synthesis) as well as when performing them.











This page was built for publication: Algebras with approximation and recursive data structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3806798)