qudt:AbstractDatatype| Predicate | Object |
|---|---|
rdf:type |
owl:Class |
rdf:type |
rdfs:Class |
rdf:type |
sh:NodeShape |
dcterms:description |
An "Abstract Datatype" (ADT) is a specification of a set of data and the set of operations that can be performed on the data. Such a data type is abstract in the sense that it is independent of various concrete implementations. The definition can be mathematical, or it can be programmed as an interface. A first class ADT supports the creation of multiple instances of the ADT, and the interface normally provides a constructor, which returns an abstract handle to new data, and several operations, which are functions accepting the abstract handle as an argument. |
prov:wasInfluencedBy |
http://en.wikipedia.org/wiki/Abstract_data_type |
prov:wasInfluencedBy |
http://xlinux.nist.gov/dads/HTML/abstractDataType.html |
rdfs:isDefinedBy |
http://qudt.org/3.5.2/schema/datatype |
rdfs:isDefinedBy |
http://qudt.org/3.5.2/schema/shacl/datatype |
rdfs:label |
“Abstract Datatype” |
rdfs:subClassOf |
qudt:StructuredDatatype |