Implementation of data types by algebraic methods
This paper presents a precise definition of implementation of data types, which are taken to be many-sorted algebras of a given signature (sorts and operations). No particular presentation (e.g. equational) of the data types is assumed but each element of the type is required to be reachable from the given operations. For each operation \(w_ B\) of the \(\Omega\)- algebra B to be implemented, this notion of implementation calls for the construction of an operation \(f_ w\) on the implementing algebra A and the explicit definition of an \(\Omega\)-homomorphism T from F(A) (the \(\Omega\)-subalgebra of A generated by the simulators \(f_ w)\) onto B. The surjectivity of T insures that every element of B can be represented by elements of A. This representation can be multiple as T is not required to be an isomorphism and this implies, in the case of equational presentation of the algebras A and B, that F(A) need not satisfy the axioms defining B. Unlike other approaches, the operations of the two algebras A and B are kept separate and only the operations of A are allowed in the generalized Gödel-Herbrand-Kleene schemes used to define the simulators. Sufficient conditions are given for such a scheme to define a (possibly partial) function using substitution and replacements rules. The notions are illustrated with two examples of implementations of stacks and symbol-tables, dealing with the cases of polynomial and recursively-defined simulators, respectively. Similarities with the approach by H. Ehrig, H.-J. Kreowski and P. Padawitz are analyzed and comparisons with other approaches are mentioned.
- A generalization of the homomorphism concept
- A generalized approach to formal languages
- Abstract data types and software validation
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
- Complexity of algebraic implementations for abstract data types
- Continuous Data Types
- Extensions and implementations of abstract data type specifications
- scientific article; zbMATH DE number 3649971 (Why is no real title available?)
- scientific article; zbMATH DE number 3972168 (Why is no real title available?)
- scientific article; zbMATH DE number 3681119 (Why is no real title available?)
- scientific article; zbMATH DE number 3714981 (Why is no real title available?)
- scientific article; zbMATH DE number 3737005 (Why is no real title available?)
- scientific article; zbMATH DE number 3787995 (Why is no real title available?)
- scientific article; zbMATH DE number 3512082 (Why is no real title available?)
- scientific article; zbMATH DE number 3594631 (Why is no real title available?)
- scientific article; zbMATH DE number 3597848 (Why is no real title available?)
- scientific article; zbMATH DE number 3612415 (Why is no real title available?)
- scientific article; zbMATH DE number 3640851 (Why is no real title available?)
- scientific article; zbMATH DE number 1086650 (Why is no real title available?)
- scientific article; zbMATH DE number 3441605 (Why is no real title available?)
- scientific article; zbMATH DE number 3227055 (Why is no real title available?)
- scientific article; zbMATH DE number 3290336 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3423547 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- Inductive methods for proving properties of programs
- Initial Algebra Semantics and Continuous Algebras
- IO and OI. II
- On some classes of interpretations
- On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types
- Program schemes, recursion schemes, and formal languages
- Recursion-closed algebraic theories
- Regular trees and the free iterative theory
- Relative complexity of algebras
- The algebraic specification of abstract data types
- The existence and construction of free iterative theories
- Towards a theory of semantics and compilers for programming languages
- Unique fixed points vs. least fixed points
- On the implementation of abstract data types by programming language constructs
- Algebraic specification of modules and their basic interconnections
- SK implementation of some data types
- scientific article; zbMATH DE number 3921971 (Why is no real title available?)
- scientific article; zbMATH DE number 3995032 (Why is no real title available?)
- scientific article; zbMATH DE number 3999266 (Why is no real title available?)
- Hybrid implementations of algebraic specifications
This page was built for publication: Implementation of data types by algebraic methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792753)