On the public citation graph
Partial interpretations of higher order algebraic types
0 signed · 22 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-10699-5_101openalex-snapshot
On the algebraic extensions of abstract data types
inferredcites →https://doi.org/10.1007/3-540-12727-5_1openalex-snapshot
Generalized heterogeneous algebras and partial interpretations
inferredcites →https://doi.org/10.1007/bf00264293openalex-snapshot
On hierarchies of abstract data types
inferredcites →https://doi.org/10.1007/bfb0022542openalex-snapshot
Abstract data types as lattices of finitely generated models
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/321992.321997openalex-snapshot
Initial Algebra Semantics and Continuous Algebras
inferredcites →https://doi.org/10.21236/ada239419openalex-snapshot
Mathematical Theory of Computation
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-17654-3_15openalex-snapshot
VDM proof obligations and their justification
inferred← citeshttps://doi.org/10.1007/3-540-18341-8_20openalex-snapshot
Software development based on formal methods
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-53982-4_8openalex-snapshot
Non-strict don't care algebras and 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/bf01209625openalex-snapshot
An algebraic semantics of higher-order types with subtypes
inferred← citeshttps://doi.org/10.1007/bfb0026101openalex-snapshot
Algebraic specification with built-in domain constructions
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/j.scico.2007.04.002openalex-snapshot
Engineering and theoretical underpinnings of retrenchment
inferred← citeshttps://doi.org/10.1017/s0960129500000888openalex-snapshot
Non-strict don't care algebras and specifications
inferred← citeshttps://doi.org/10.1515/9783112720875openalex-snapshot
A Model Theoretic Oriented Approach to Partial Algebras
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.