On the public citation graph

DI-domains as information systems

https://doi.org/10.1007/bfb0035798
0 signed · 18 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-08860-1_7openalex-snapshot
Stable models of typed λ-calculi
inferredcites →https://doi.org/10.1007/3-540-13346-1_5openalex-snapshot
Using information systems to solve reoursive domain equations effectively
inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/bfb0012801openalex-snapshot
Domains for denotational semantics
inferredcites →https://doi.org/10.1016/0304-3975(81)90112-2openalex-snapshot
Petri nets, event structures and domains, part I
inferredcites →https://doi.org/10.1016/0304-3975(87)90045-4openalex-snapshot
Linear logic
inferredcites →https://doi.org/10.7146/dpb.v18i298.6692openalex-snapshot
Logics of Domains

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/malq.201600020openalex-snapshot
Normal forms, linearity, and prime algebraicity over nonflat domains
inferred← citeshttps://doi.org/10.1007/3-540-55511-0_21openalex-snapshot
A monoidal closed category of event structures
inferred← citeshttps://doi.org/10.1007/978-1-4471-3503-6_8openalex-snapshot
Self-duality, Minimal Invariant Objects and Karoubi Invariance in Information Categories
inferred← citeshttps://doi.org/10.1007/bf00880044openalex-snapshot
Information categories
inferred← citeshttps://doi.org/10.1007/bfb0017483openalex-snapshot
Nondeterministic automata with concurrency relations and domains
inferred← citeshttps://doi.org/10.1007/bfb0032032openalex-snapshot
Concurrency, automata and domains
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90215-2openalex-snapshot
Stable neighbourhoods
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00191-3openalex-snapshot
The largest cartesian closed category of stable domains
inferred← citeshttps://doi.org/10.1017/s0960129500000177openalex-snapshot
Universal domains and the amalgamation property
inferred← citeshttps://doi.org/10.1017/s0960129500000207openalex-snapshot
Some monoidal closed categories of stable domains and event structures
inferred← citeshttps://doi.org/10.1109/lics.1990.113730openalex-snapshot
Universal domains in the theory of denotational semantics 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.