On the public citation graph
Compiling OR-parallelism into AND-parallelism
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.
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-15976-2_6openalex-snapshot
An experiment in partial evaluation: The generation of a compiler generator
inferredcites →https://doi.org/10.1007/3-540-16492-8_72openalex-snapshot
A GHC abstract machine and instruction set
inferredcites →https://doi.org/10.1007/bf01414556openalex-snapshot
A parallel implementation of Flat Concurrent Prolog
inferredcites →https://doi.org/10.1109/mc.1986.1663307openalex-snapshot
Concurrent Prolog: A Progress Report
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-1-4471-3494-7_19openalex-snapshot
Automated Translation of Occam to a Concurrent Logic Language
inferred← citeshttps://doi.org/10.1007/978-1-4471-3546-3_2openalex-snapshot
Speculative Computation and Priorities in Concurrent Logic Languages
inferred← citeshttps://doi.org/10.1007/978-1-4613-1619-0_10openalex-snapshot
Unify with Active Memory
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/978-3-662-40145-3_7openalex-snapshot
Concurrent Prolog: A Progress Report
inferred← citeshttps://doi.org/10.1007/bf01408020openalex-snapshot
Parallel branch-and-bound search in Parlog
inferred← citeshttps://doi.org/10.1016/0743-1066(89)90016-2openalex-snapshot
OR-parallel PROLOG in flat concurrent PROLOG
inferred← citeshttps://doi.org/10.1109/52.469762openalex-snapshot
Programming in concurrent logic languages
inferred← citeshttps://doi.org/10.1145/43908.43910openalex-snapshot
A bibliography on partial evaluation
inferred← citeshttps://doi.org/10.1145/72551.72555openalex-snapshot
The family of concurrent logic programming languages
inferred← citeshttps://doi.org/10.1145/93542.93565openalex-snapshot
Generators and the replicator control structure in the parallel environment of ALLOY
inferred← citeshttps://doi.org/10.1145/93548.93565openalex-snapshot
Generators and the replicator control structure in the parallel environment of ALLOY
inferred← citeshttps://doi.org/10.20868/upm.thesis.14975openalex-snapshot
An abstract machine based execution model for computer architecture design and efficient implementation of logic programs in parallel.
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.