On the public citation graph

Unfolding rules for GHC programs

https://doi.org/10.1007/bf03037135
0 signed · 15 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/3-540-10699-5_102openalex-snapshot
Scenarios: A model of non-determinate computation
inferredcites →https://doi.org/10.1007/3-540-16479-0_17openalex-snapshot
Guarded horn clauses
inferredcites →https://doi.org/10.1007/978-1-4613-1989-4_6openalex-snapshot
Parlog: Parallel Programming in Logic
inferredcites →https://doi.org/10.1109/mc.1986.1663307openalex-snapshot
Concurrent Prolog: A Progress Report
inferredcites →https://doi.org/10.1145/5001.5390openalex-snapshot
PARLOG: parallel programming in logic

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-53162-9_40openalex-snapshot
Unfolding and fixpoint semantics of concurrent constraint logic programs
inferred← citeshttps://doi.org/10.1007/978-1-4471-3156-4_4openalex-snapshot
Problem-Solving and Inference Software
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/bf01887205openalex-snapshot
Meta-interpreters and partial evaluation in Parlog
inferred← citeshttps://doi.org/10.1007/bf03037136openalex-snapshot
Specialisation of Prolog and FCP programs using abstract interpretation
inferred← citeshttps://doi.org/10.1007/bf03037145openalex-snapshot
Annotated bibliography on partial evaluation and mixed computation
inferred← citeshttps://doi.org/10.1007/bf03037949openalex-snapshot
Proving termination of GHC programs
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90288-qopenalex-snapshot
Unfolding and fixpoint semantics of concurrent constraint logic programs
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90036-2openalex-snapshot
Comparative semantics for flow of control in logic programming without logic
inferred← citeshttps://doi.org/10.1145/72551.72555openalex-snapshot
The family of concurrent logic programming 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.