On the public citation graph

Mathematical Foundations of Programming Semantics

https://doi.org/10.1007/bfb0040251
0 signed · 26 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/bfb0040252openalex-snapshot
A generalized Kahn Principle for abstract asynchronous networks
inferredcites →https://doi.org/10.1007/bfb0040257openalex-snapshot
Unbounded nondeterminism in CSP
inferredcites →https://doi.org/10.1007/bfb0040258openalex-snapshot
The semantics of priority and fairness in occam
inferredcites →https://doi.org/10.1007/bfb0040259openalex-snapshot
Inductively defined types in the Calculus of Constructions
inferredcites →https://doi.org/10.1007/bfb0040265openalex-snapshot
A category-theoretic semantics for unbounded indeterminacy
inferredcites →https://doi.org/10.1007/bfb0040268openalex-snapshot
L-domains and lossless powerdomains
inferredcites →https://doi.org/10.1007/bfb0040272openalex-snapshot
Initial algebra semantics for lambda calculi

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-0-387-35261-9_29openalex-snapshot
CSP-OZ: A Combination of Object-Z and CSP
inferred← citeshttps://doi.org/10.1007/978-3-540-31847-7_5openalex-snapshot
Graph Processes with Fusions: Concurrency by Colimits, Again
inferred← citeshttps://doi.org/10.1007/978-3-642-23178-0_3openalex-snapshot
On Quantitative Security Policies
inferred← citeshttps://doi.org/10.1007/s10516-023-09662-6openalex-snapshot
On Giving Meanings to Programs
inferred← citeshttps://doi.org/10.1016/b978-0-444-89402-1.50025-4openalex-snapshot
An upward compatible timed extension to LOTOS
inferred← citeshttps://doi.org/10.1016/j.apal.2018.03.002openalex-snapshot
From realizability to induction via dependent intersection
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.030openalex-snapshot
Almost Every Domain is Universal
inferred← citeshttps://doi.org/10.1016/j.entcs.2020.08.002openalex-snapshot
EVL: A Typed Higher-order Functional Language for Events
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105151openalex-snapshot
Solving mean-payoff games via quasi dominions
inferred← citeshttps://doi.org/10.1016/j.infsof.2013.09.002openalex-snapshot
A hybrid class- and prototype-based object model to support language-neutral structural intercession
inferred← citeshttps://doi.org/10.1016/j.jlamp.2014.12.004openalex-snapshot
Deciding Kleene algebra terms equivalence in Coq
inferred← citeshttps://doi.org/10.1016/j.jlap.2013.05.004openalex-snapshot
Session types for safe Web service orchestration
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.042openalex-snapshot
The Girard–Reynolds isomorphism (second edition)
inferred← citeshttps://doi.org/10.1016/s1571-0661(03)50016-0openalex-snapshot
Chu Spaces, Concept Lattices, and Domains
inferred← citeshttps://doi.org/10.1109/iccl.1994.288373openalex-snapshot
State space reduction in abstract interpretation of parallel programs
inferred← citeshttps://doi.org/10.1109/lics.1990.113730openalex-snapshot
Universal domains in the theory of denotational semantics of programming languages
inferred← citeshttps://doi.org/10.1109/pnpm.1991.238777openalex-snapshot
Modelling layered protocols in LOOPN
inferred← citeshttps://doi.org/10.1145/1391956.1391961openalex-snapshot
Dually nondeterministic functions
inferred← citeshttps://doi.org/10.1145/384101.384117openalex-snapshot
Modeling inheritance as coercion in a symbolic computation system
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.