On the public citation graph
On semantic foundations for applicative multiprogramming
0 signed · 50 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-10003-2_59openalex-snapshot
Semantics of unbounded nondeterminism
inferredcites →https://doi.org/10.1007/3-540-10007-5_47openalex-snapshot
On the semantics of fair parallelism
inferredcites →https://doi.org/10.1007/3-540-10007-5_48openalex-snapshot
Dijkstra's predicate transformers and smyth's powerdomains
inferredcites →https://doi.org/10.1007/3-540-11494-7_13openalex-snapshot
Powerdomains and nondeterministic recursive definitions
inferredcites →https://doi.org/10.1007/3-540-11494-7_21openalex-snapshot
On effective computations of non-deterministic schemes
inferredcites →https://doi.org/10.1007/bf01752392openalex-snapshot
Algebraic specification of data types: A synthetic approach
inferredcites →https://doi.org/10.1016/0304-3975(77)90044-5openalex-snapshot
LCF considered as a programming language
inferredcites →https://doi.org/10.1109/sfcs.1976.9openalex-snapshot
Categories for fixpoint-semantics
inferredcites →https://doi.org/10.1145/321992.321997openalex-snapshot
Initial Algebra Semantics and Continuous Algebras
inferredcites →https://doi.org/10.7146/dpb.v10i133.18448openalex-snapshot
A Cook's Tour of Countable Nondeterminism
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1991.9999openalex-snapshot
A domain equation for bisimulation
inferred← citeshttps://doi.org/10.1006/inco.1995.1145openalex-snapshot
Nondeterministic Extensions of Untyped λ-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_89openalex-snapshot
Experiments, powerdomains and fully abstract models for applicative multiprogramming
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_23openalex-snapshot
Semantics of networks containing indeterminate operators
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_24openalex-snapshot
Abstract interpretation and indeterminacy
inferred← citeshttps://doi.org/10.1007/3-540-15975-4_31openalex-snapshot
Secd-m: a virtual machine for applicative programming
inferred← citeshttps://doi.org/10.1007/3-540-16442-1_18openalex-snapshot
Denotational semantics of nets with nondeterminism
inferred← citeshttps://doi.org/10.1007/3-540-17162-2_127openalex-snapshot
A note on distributive laws and power domains
inferred← citeshttps://doi.org/10.1007/3-540-17945-3_20openalex-snapshot
A fully abstract semantics for data flow nets
inferred← citeshttps://doi.org/10.1007/3-540-50325-0_9openalex-snapshot
Observing nondeterministic data types
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_45openalex-snapshot
The expressive power of indeterminate primitives in asynchronous computation
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_10openalex-snapshot
A Simple Generalization of Kahn’s Principle to Indeterminate Dataflow Networks
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_11openalex-snapshot
Defining Fair Merge as a Colimit: Towards a Fixed-Point Theory for Indeterminate Dataflow
inferred← citeshttps://doi.org/10.1007/bf01660035openalex-snapshot
Semantics of digital networks containing indeterminate modules
inferred← citeshttps://doi.org/10.1007/bfb0040265openalex-snapshot
A category-theoretic semantics for unbounded indeterminacy
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90020-1openalex-snapshot
Algebraic solutions to recursion schemes
inferred← citeshttps://doi.org/10.1016/0168-0072(91)90065-topenalex-snapshot
Domain theory in logical form*
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90142-9openalex-snapshot
Interpretations of recursion under unbounded nondeterminacy
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90082-dopenalex-snapshot
An extensional fixed-point semantics for nondeterministic data flow
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90043-fopenalex-snapshot
The expressive power of indeterminate dataflow primitives
inferred← citeshttps://doi.org/10.1016/j.apal.2007.10.007openalex-snapshot
Infinite trace equivalence
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.069openalex-snapshot
Infinite Trace Equivalence
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.008openalex-snapshot
The Bicategory-Theoretic Solution of Recursive Domain Equations
inferred← citeshttps://doi.org/10.1016/j.ic.2008.03.027openalex-snapshot
On the completeness of order-theoretic models of the λ-calculus
inferred← citeshttps://doi.org/10.1016/j.mathsocsci.2017.08.003openalex-snapshot
Inferring probability comparisons
inferred← citeshttps://doi.org/10.1017/s0960129505004718openalex-snapshot
Profunctors, open maps and bisimulation
inferred← citeshttps://doi.org/10.1017/s0960129509990375openalex-snapshot
Some reasons for generalising domain theory
inferred← citeshttps://doi.org/10.1017/s0960129598002710openalex-snapshot
On categories generalizing universal domains
inferred← citeshttps://doi.org/10.1109/lics.1998.705658openalex-snapshot
A theory of recursive domains with applications to concurrency
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21954openalex-snapshot
Nonexpressibility of fairness and signaling
inferred← citeshttps://doi.org/10.1137/s0097539794275860openalex-snapshot
A Filter Model for Concurrent $\lambda$-Calculus
inferred← citeshttps://doi.org/10.3233/fi-1997-323401openalex-snapshot
A Convex Powerdomain over Lattices: its Logic and λ-Calculus
inferred← citeshttps://doi.org/10.4230/lipics.csl.2016.11openalex-snapshot
Models and theories of lambda calculus
inferred← citeshttps://doi.org/10.4230/lipics.itp.2019.31openalex-snapshot
Domain Theory and the Logic of Observable Properties
inferred← citeshttps://doi.org/10.7146/brics.v11i22.21847openalex-snapshot
Profunctors, Open Maps and Bisimulation
inferred← citeshttps://doi.org/10.7146/brics.v3i44.20046openalex-snapshot
A Presheaf Semantics of Value-Passing Processes
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.