On the public citation graph
A domain-theoretic model for a higher-order process calculus
0 signed · 29 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.1006/inco.1993.1044openalex-snapshot
Full Abstraction in the Lazy Lambda Calculus
inferredcites →https://doi.org/10.1007/3-540-17945-3_20openalex-snapshot
A fully abstract semantics for data flow nets
inferredcites →https://doi.org/10.1007/3-540-50939-9_130openalex-snapshot
Towards a lambda-calculus for concurrent and communicating systems
inferredcites →https://doi.org/10.1007/3-540-51285-3_52openalex-snapshot
The typed λ-calculus with first-class processes
inferredcites →https://doi.org/10.1007/bfb0032031openalex-snapshot
A domain-theoretic model for a higher-order process calculus
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1109/sfcs.1989.63474openalex-snapshot
Full abstraction for nondeterministic dataflow networks
inferredcites →https://doi.org/10.1137/0205036openalex-snapshot
The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
inferredcites →https://doi.org/10.1137/0211062openalex-snapshot
The Category-Theoretic Solution of Recursive Domain Equations
inferredcites →https://doi.org/10.1145/53990.54015openalex-snapshot
Synchronous operations as first-class values
inferredcites →https://doi.org/10.1145/75277.75290openalex-snapshot
A calculus of higher order communicating systems
inferredcites →https://doi.org/10.1145/75277.75291openalex-snapshot
A fully abstract trace model for dataflow networks
inferredcites →https://doi.org/10.1145/960116.54015openalex-snapshot
Synchronous operations as first-class values
inferredcites →https://doi.org/10.48456/tr-263openalex-snapshot
The Lazy Lambda Calculus: an investigation into the foundations of functional programming
inferredcites →https://doi.org/10.7146/dpb.v15i208.7559openalex-snapshot
A Calculus of Communicating Systems with Label Passing
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.1994.1052openalex-snapshot
A Fully Abstract Denotational Model for Higher-Order Processes
inferred← citeshttps://doi.org/10.1006/inco.1995.1145openalex-snapshot
Nondeterministic Extensions of Untyped λ-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_11openalex-snapshot
Must preorder in non-deterministic untyped λ-calculus
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_45openalex-snapshot
Fully abstract semantics for higher order communicating systems
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_44openalex-snapshot
A hyperdoctrinal view of concurrent constraint programming
inferred← citeshttps://doi.org/10.1007/3-540-58027-1_6openalex-snapshot
Topological models for higher order control flow
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00281-4openalex-snapshot
A fully abstract denotational semantics for the calculus of higher-order communicating systems
inferred← citeshttps://doi.org/10.1109/lics.1993.287568openalex-snapshot
A fully abstract denotational model for higher-order processes
inferred← citeshttps://doi.org/10.1109/lics.1993.287580openalex-snapshot
Non-determinism in a functional setting
inferred← citeshttps://doi.org/10.1145/2535838.2535872openalex-snapshot
On coinductive equivalences for higher-order probabilistic functional programs
inferred← citeshttps://doi.org/10.1145/99583.99627openalex-snapshot
The semantic foundations of concurrent constraint programming
showing the first 11 of 12 · page through all 12
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.