Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Abstract: Graph-structured data appears frequently in domains including chemistry, natural language semantics, social networks… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 3
Highly Cited
2004
Highly Cited
2004
SummaryThere have been many recent proposals for embedding abstract data types in programming languages. In order to reason about… Expand
  • figure 2
  • figure 3
Review
2003
Review
2003
1 Introduction.- 1.1 Goals of the Book and Contours of its Method.- 1.1.1 Stepwise Refinable Abstract Operational Modeling.- 1.1… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Review
2002
Review
2002
  • J. C. Reynolds
  • Proceedings 17th Annual IEEE Symposium on Logic…
  • 2002
  • Corpus ID: 6271346
In joint work with Peter O'Hearn and others, based on early ideas of Burstall, we have developed an extension of Hoare logic that… Expand
Highly Cited
1992
Highly Cited
1992
  • K. Jensen
  • EATCS Monographs in Theoretical Computer Science
  • 1992
  • Corpus ID: 2224013
data base When the user creates a CPN diagram, the editor stores all the semantic information in an abstract data base, from… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Review
1988
Review
1988
Abstract data type declarations appear in typed programming languages like Ada, Alphard, CLU and ML. This form of declaration… Expand
  • figure 1
Review
1985
Review
1985
Our objective is to understand the notion of type in programming languages, present a model of typed, polymorphic programming… Expand
  • figure 1
  • figure 2
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… Expand
  • figure 3
  • figure 4
  • figure 8
  • figure 9
  • figure 10
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… Expand
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… Expand