abstract data type

Mathematical model for data types

Also known as ADT

Instance of: computer science term
Subclass of: mathematical model
, data type

Overview

From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0

In computer science, an abstract data type (ADT) is a mathematical model for data types, defined by its behavior (semantics) from the point of view of a user of the data, specifically in terms of possible values, possible operations on data of this type, and the behavior of these operations. This mathematical model contrasts with data structures, which are concrete representations of data, and represent the point of view of an implementer, not a user. For example, a stack has push/pop operations that follow a Last-In-First-Out rule, and can be concretely implemented using either a linked list or an array. Another example is a set which stores values, without any particular order, and no repeated values. Values themselves are not retrieved from sets; rather, one tests a value for membership to obtain a Boolean "in" or "not in".

Overview

All data

37 statements · 19% with external sources · numbers in brackets are citations

Different from: algebraic data type
abstract type
data structure
ACM Classification Code (2012): 10003202
Represents: data type

On other databases

21 identifiers linking abstract data type across the web's reference databases

Data quality

statements

19%

externally sourced

Source last edited October 3, 2026. AIDb refreshes this page daily.

Suggest a fact or correction

Links

Use this data

curl https://aidb.si/api/v1/entities/Q827335

API docs, limits & keys

Cite this page

AIDb. (2026). abstract data type (Q827335). Retrieved from https://aidb.si/e/abstract-data-type-Q827335