Abstract data type

Known as: Abstract datatype, ADT, Abstract data types 
In computer science, an abstract data type (ADT) is a mathematical model for data types where a data type is defined by its behavior (semantics) from… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
1994
Highly Cited
1994
Many statically typed programming languages provide an abstract data type construct, such as the module in Modula-2. However, in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1992
Highly Cited
1992
There is a population explosion among the logical systems used in computing science. Examples include first-order logic… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We define a new locking protocol that permits more concency than existing commutativity-based protocols. In addition, the… (More)
  • figure 4-2
  • figure 4-3
  • figure 4-5
  • figure 7.1
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Atomic actions (or transactions) are useful for coping with concurrency and failures. One way of ensuring atomicity of actions is… (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Two novel concurrency control algorithms for abstract data types are presented. The algorithms ensure serializability of… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
data types have proved to be a useful technique for structuring systems. In large systems it is sometimes useful to have… (More)
  • figure 1
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1980
Highly Cited
1980
The equational axioms of an algebraic specification of a data type (such as finite sequences) often can be formed into a… (More)
Is this relevant?
Highly Cited
1978
Highly Cited
1978
There have been many recent proposals for embedding abstract data types in programming languages. In order to reason about… (More)
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1978
Highly Cited
1978
A data abstraction can be naturally specified using algebraic axioms. The virtue of these axioms is that they permit a… (More)
  • figure 3
  • figure 4
  • figure 8
  • figure 9
  • figure 10
Is this relevant?
Highly Cited
1974
Highly Cited
1974
The motivation behind the work in very-high-level languages is to ease the programming task by providing the programmer with a… (More)
Is this relevant?