On abstract data types presented by multiequations

Authors:
J. Adámek;M. Hébert;J. Rosický
Affiliations:
Technical Univ. Braunschweig, Braunschweig, Germany;The American Univ. in Cairo, Cairo, Egypt;Masaryk Univ., Brno, Czech Republic
Venue:
Theoretical Computer Science
Year:
2002

Citing 2
Cited 3

Algebraic specification

Handbook of theoretical computer science (vol. B)
Fundamentals of Algebraic Specification I

Fundamentals of Algebraic Specification I

On tree coalgebras and coalgebra presentations

Theoretical Computer Science
The rational numbers as an abstract data type

Journal of the ACM (JACM)
Elementary algebraic specifications of the rational function field

CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers

Quantified Score

Hi-index	5.23

Visualization

Abstract

Equational presentation of abstract data types is generalized to presentation by multiequations, i.e., exclusive-or's of equations, in order to capture parametric data types such as array or set. Multiinitial-algebra semantics for such data types is introduced. Classes of algebras described by multiequations are characterized.