On the public citation graph

Algebraic specification with built-in domain constructions

https://doi.org/10.1007/bfb0026101
0 signed · 28 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-10007-5_41openalex-snapshot
The semantics of clear, a specification language
inferredcites →https://doi.org/10.1007/978-3-642-61284-8openalex-snapshot
Fundamentals of Algebraic Specification 2
inferredcites →https://doi.org/10.1007/978-3-642-61807-9openalex-snapshot
Algorithmic Language and Program Development
inferredcites →https://doi.org/10.1007/bfb0016232openalex-snapshot
Partial interpretations of higher order algebraic types
inferredcites →https://doi.org/10.1016/0022-0000(86)90057-7openalex-snapshot
Quasi-varieties in abstract algebraic institutions
inferredcites →https://doi.org/10.1016/0304-3975(77)90044-5openalex-snapshot
LCF considered as a programming language
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(84)90086-0openalex-snapshot
A systematic study of models of abstract data types
inferredcites →https://doi.org/10.1016/0304-3975(84)90125-7openalex-snapshot
Characterizing specification languages which admit initial semantics
inferredcites →https://doi.org/10.1016/0304-3975(85)90094-5openalex-snapshot
On the existence of free models in abstract algebraic institutions
inferredcites →https://doi.org/10.1016/s0019-9958(86)80027-4openalex-snapshot
On specifications, theories, and models with higher types
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7034-xopenalex-snapshot
Model Theory For Infinitary Logic
inferredcites →https://doi.org/10.3233/fi-1986-9106openalex-snapshot
Continuous Abstract Data Types

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-50325-0_8openalex-snapshot
Algebraic specifications of reachable higher-order algebras
inferred← citeshttps://doi.org/10.1007/3-540-50939-9_125openalex-snapshot
On the existence of initial models for partial (higher-order) conditional specifications
inferred← citeshttps://doi.org/10.1007/3-540-52337-6_28openalex-snapshot
Functor-argument structures for the meaning of natural language sentences and their formal interpretation
inferred← citeshttps://doi.org/10.1007/3-540-53912-3_16openalex-snapshot
Formalizing informal requirements some aspects
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_50openalex-snapshot
Partial higher-order specifications
inferred← citeshttps://doi.org/10.1007/3-540-58233-9_11openalex-snapshot
Ordered and continuous models of higher-order specifications
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_50openalex-snapshot
Order-sorted algebraic specifications with higher-order functions
inferred← citeshttps://doi.org/10.1007/3-540-61254-8_21openalex-snapshot
R n - and G n -logics
inferred← citeshttps://doi.org/10.1007/3-540-61629-2_47openalex-snapshot
Combining algebraic and set-theoretic specifications
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00246-5openalex-snapshot
Free objects and equational deduction for partial conditional specifications
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90069-2openalex-snapshot
A logic of recursion
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00323-4openalex-snapshot
Order-sorted algebraic specifications with higher-order functions
inferred← citeshttps://doi.org/10.1109/69.334861openalex-snapshot
An algebraic theory of object-oriented systems
inferred← citeshttps://doi.org/10.7146/brics.v3i51.20054openalex-snapshot
Rn and Gn Logics
inferred← citeshttps://doi.org/10.7146/brics.v3i52.20055openalex-snapshot
Combining Algebraic and Set-Theoretic Specifications (Extended Version)
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.