Everything About ___
Live briefing

Everything about Abstract data type

Mathematical model for data types

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". Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Abstract data typeA 5-minute orientation
  2. Skim a recent paper: Semantic Code Refactoring for Abstract Data TypesInfluential work since 2022
  3. Pick up a classic book: Data abstraction and problem solving with C++The most-reprinted book on the subject
  4. Read the landmark paper: Abstract Data Type Specification in the Affirm SystemCited 68 times
  5. Go sideways: Data typeA closely related topic
  6. Go sideways: Algebraic semantics (computer science)A closely related topic

📖 Definitions

Noun A data type defined only by data properties and operations to be performed on the data without any specification as to how the data will be represented or the operations performed.

🗂️ The subject at a glance

  1. History
  2. Definition
  3. Examples
  4. Implementation

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics