On the public citation graph
Abstract data types as lattices of finitely generated models
0 signed · 57 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-07854-1_231openalex-snapshot
Observability concepts in abstract data type specification
inferredcites →https://doi.org/10.1007/3-540-08860-1_16openalex-snapshot
Stepwise specification and implementation of abstract data types
inferredcites →https://doi.org/10.1007/3-540-09510-1_3openalex-snapshot
A characterization of abstract data as model-theoretic invariants
inferredcites →https://doi.org/10.1007/3-540-09510-1_7openalex-snapshot
Existential quantifiers in abstract data types
inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/bf00260922openalex-snapshot
The algebraic specification of abstract data types
inferredcites →https://doi.org/10.1007/bf01182063openalex-snapshot
Das Entscheidungsproblem der Klasse von Formeln, die h�chstens zwei Primformeln enthalten
inferredcites →https://doi.org/10.1007/bf02011871openalex-snapshot
Kleine unentscheidbare Klassen der Prädikatenlogik mit Identität und Funktionszeichen
inferredcites →https://doi.org/10.1016/0022-0000(78)90016-8openalex-snapshot
On some classes of interpretations
inferredcites →https://doi.org/10.1016/0022-0000(79)90011-4openalex-snapshot
Final algebra semantics and data type extensions
inferredcites →https://doi.org/10.1016/0304-3975(77)90053-6openalex-snapshot
Fully abstract models of typed λ-calculi
inferredcites →https://doi.org/10.1016/0304-3975(79)90059-8openalex-snapshot
Data types, abstract data types and their specification problem
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-10699-5_101openalex-snapshot
On the algebraic extensions of abstract data types
inferred← citeshttps://doi.org/10.1007/3-540-10828-9_51openalex-snapshot
Algebraic theory of parameterized specifications with requirements
inferred← citeshttps://doi.org/10.1007/3-540-10828-9_61openalex-snapshot
On the algebraic specification of nondeterministic programming languages
inferred← citeshttps://doi.org/10.1007/3-540-10828-9_65openalex-snapshot
Initial and terminal algebra semantics of parameterized abstract data type specifications with inequalities
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-11490-4_21openalex-snapshot
Parameter passing in algebraic specification languages
inferred← citeshttps://doi.org/10.1007/3-540-12727-5_1openalex-snapshot
Generalized heterogeneous algebras and partial interpretations
inferred← citeshttps://doi.org/10.1007/3-540-12925-1_39openalex-snapshot
Un systeme d'aide a la preuve de compilateurs
inferred← citeshttps://doi.org/10.1007/3-540-50325-0_1openalex-snapshot
The stratified loose approach: A generalization of initial and loose semantics
inferred← citeshttps://doi.org/10.1007/3-540-50667-5_59openalex-snapshot
Integrating logic programming and equational specification of abstract data types
inferred← citeshttps://doi.org/10.1007/3-540-56379-2_38openalex-snapshot
Label algebras: A systematic use of terms
inferred← citeshttps://doi.org/10.1007/978-1-4615-9385-0_11openalex-snapshot
Stepwise Construction of Algebraic Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-46490-4_18openalex-snapshot
Algebraic Methods for Program Construction: The Project CIP
inferred← citeshttps://doi.org/10.1007/978-3-642-67838-7_28openalex-snapshot
Polynomials — The Specification, Analysis and Development of an Abstract Data Type
inferred← citeshttps://doi.org/10.1007/978-3-642-87374-4_8openalex-snapshot
Equational Specification of Partial Higher Order Algebras
inferred← citeshttps://doi.org/10.1007/978-94-009-7893-5_12openalex-snapshot
An Analysis of Semantic Models for Algebraic Specifications
inferred← citeshttps://doi.org/10.1007/bf00263582openalex-snapshot
Crypt-equivalent algebraic specifications
inferred← citeshttps://doi.org/10.1007/bf00264293openalex-snapshot
On hierarchies of abstract data types
inferred← citeshttps://doi.org/10.1007/bf00283330openalex-snapshot
A second order theory of data types
inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot
Semantics of algorithmic languages
inferred← citeshttps://doi.org/10.1007/bf02737105openalex-snapshot
A second order theory of data types
inferred← citeshttps://doi.org/10.1007/bfb0016232openalex-snapshot
Partial interpretations of higher order algebraic types
inferred← citeshttps://doi.org/10.1016/0167-6423(94)00021-2openalex-snapshot
Label algebras and exception handling
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90065-8openalex-snapshot
Parameter passing in algebraic specification languages
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90086-0openalex-snapshot
A systematic study of models of abstract data types
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90051-4openalex-snapshot
Structured algebraic specifications: A Kernel language
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90123-xopenalex-snapshot
Algebraic specifications of computable and semicomputable data types
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90162-4openalex-snapshot
Equational specification of partial higher-order algebras
inferred← citeshttps://doi.org/10.1016/b978-0-12-046370-1.50013-9openalex-snapshot
Some Fixpoint Techniques in Algebraic Structures and Applications to Computer Science
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50018-4openalex-snapshot
Algebraic Specification
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)80021-1openalex-snapshot
The completeness of the algebraic specification methods for computable data types
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71821-4openalex-snapshot
Model Theoretic Issues in Theoretical Computer Science, Part I: Relational Data Bases and Abstract Data Types
inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60131-xopenalex-snapshot
Specification and Implementation of Abstract Data Types
inferred← citeshttps://doi.org/10.1016/s0304-3975(82)80001-7openalex-snapshot
Algebraic implementation of abstract data types
inferred← citeshttps://doi.org/10.1051/ita/1983170201371openalex-snapshot
Algebraic definition of a functional programming language and its semantic models
inferred← citeshttps://doi.org/10.1137/0212024openalex-snapshot
Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
inferred← citeshttps://doi.org/10.1137/0220049openalex-snapshot
Equality-Test and If-Then-Else Algebras: Axiomatization and Specification
inferred← citeshttps://doi.org/10.1145/357195.357202openalex-snapshot
Final Data Types and Their Specification
inferred← citeshttps://doi.org/10.1145/9758.10501openalex-snapshot
On the algebraic definition of programming languages
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.