On the public citation graph
An approach to fair applicative multiprogramming
0 signed · 24 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_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/bfb0055035openalex-snapshot
Automata, Languages and Programming
inferredcites →https://doi.org/10.1016/s0022-0000(74)80048-6openalex-snapshot
Correct and optimal implementations of recursion in a simple programming language
inferredcites →https://doi.org/10.1016/s0049-237x(08)72018-4openalex-snapshot
A Basis for a Mathematical Theory of Computation )
inferredcites →https://doi.org/10.1016/s0049-237x(09)70099-0openalex-snapshot
A Basis for a Mathematical Theory of Computation
inferredcites →https://doi.org/10.1145/359545.359563openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.21236/ada239419openalex-snapshot
Mathematical Theory of Computation
inferredcites →https://doi.org/10.2307/2218270openalex-snapshot
Computer Programming and Formal Systems.
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-15975-4_43openalex-snapshot
Design for a multiprocessing heap with on-board reference counting
inferred← citeshttps://doi.org/10.1007/978-1-4757-3851-3_9openalex-snapshot
Global State Considered Unnecessary: Introduction to Object-Based Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-76799-9_10openalex-snapshot
The Family of Concurrent Logic Programming Languages
inferred← citeshttps://doi.org/10.1007/bf01806032openalex-snapshot
Global state considered unnecessary: An introduction to object-based semantics
inferred← citeshttps://doi.org/10.1007/bfb0022685openalex-snapshot
Concurrent Prolog: A progress report
inferred← citeshttps://doi.org/10.1016/0096-0551(83)90029-2openalex-snapshot
Concurrent applicative implementations of nondeterministic algorithms
inferred← citeshttps://doi.org/10.1016/0167-739x(92)90010-9openalex-snapshot
The connection machine opportunity for the implementation of a concurrent functional language
inferred← citeshttps://doi.org/10.1109/mc.1986.1663307openalex-snapshot
Concurrent Prolog: A Progress Report
inferred← citeshttps://doi.org/10.1109/tse.1982.235254openalex-snapshot
An Operational Approach to Requirements Specification for Embedded Systems
inferred← citeshttps://doi.org/10.1145/1500774.1500859openalex-snapshot
Models, languages, and heuristics for distributed computing
inferred← citeshttps://doi.org/10.1145/567446.567470openalex-snapshot
An indeterminate constructor for applicative programming
inferred← citeshttps://doi.org/10.1145/72551.72555openalex-snapshot
The family of concurrent logic programming languages
inferred← citeshttps://doi.org/10.1145/800068.802155openalex-snapshot
Toward an algebra of nondeterministic programs
inferred← citeshttps://doi.org/10.1145/800087.802785openalex-snapshot
Explicit parallelism in LISP-like 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.