On the public citation graph
Abstract implementation of abstract data types
0 signed · 23 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-08442-8_77openalex-snapshot
Initial Algebraic Semantics for Non Context-Free Languages
inferredcites →https://doi.org/10.1007/3-540-08921-7_64openalex-snapshot
Extensions and implementations of abstract data type specifications
inferredcites →https://doi.org/10.1145/322290.322303openalex-snapshot
On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types
inferredcites →https://doi.org/10.1145/359657.359666openalex-snapshot
Abstract data types and software validation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-10854-8_2openalex-snapshot
Some universal algebraic and model theoretic results in computer science
inferred← citeshttps://doi.org/10.1007/3-540-13346-1_16openalex-snapshot
Partial implementations of abstract data types: A dissenting view on errors
inferred← citeshttps://doi.org/10.1007/3-540-15199-0_14openalex-snapshot
A theory of abstract data types for program development: Bridging the gap?
inferred← citeshttps://doi.org/10.1007/978-1-4471-3227-1_12openalex-snapshot
Parameterized Recursion Theory — A Tool for the Systematic Classification of Specification Methods
inferred← citeshttps://doi.org/10.1007/978-3-662-01089-1_4openalex-snapshot
Programs as Transformations of Algebraic Theories (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot
Semantics of algorithmic languages
inferred← citeshttps://doi.org/10.1007/bfb0012775openalex-snapshot
Universal realization, persistent interconnection and implementation of abstract modules
inferred← citeshttps://doi.org/10.1007/bfb0012793openalex-snapshot
Implementation of parameterised specifications
inferred← citeshttps://doi.org/10.1007/bfb0039610openalex-snapshot
On implementations of loose abstract data type specifications and their vertical composition
inferred← citeshttps://doi.org/10.1016/0022-0000(81)90014-3openalex-snapshot
Complexity of algebraic implementations for abstract data types
inferred← citeshttps://doi.org/10.1016/0022-0000(83)90045-4openalex-snapshot
Implementation of data types by algebraic methods
inferred← citeshttps://doi.org/10.1016/s0304-3975(82)80001-7openalex-snapshot
Algebraic implementation of abstract data types
inferred← citeshttps://doi.org/10.1145/2166.357212openalex-snapshot
Parameterized Specifications: Parameter Passing and Implementation with Respect to Observability
inferred← citeshttps://doi.org/10.1145/947864.947865openalex-snapshot
Completeness of many-sorted equational logic
inferred← citeshttps://doi.org/10.25959/23231843openalex-snapshot
Algebraic reasoning in lambda calculi
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.