On the public citation graph

Moded flat GHC and its message-oriented implementation technique

https://doi.org/10.1007/bf03038307
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.
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-16479-0_17openalex-snapshot
Guarded horn clauses
inferredcites →https://doi.org/10.1007/bf03037057openalex-snapshot
Efficient unification over infinite terms
inferredcites →https://doi.org/10.1007/bf03037181openalex-snapshot
Message-oriented parallel implementation of Moded Flat GHC
inferredcites →https://doi.org/10.1007/bf03037203openalex-snapshot
A’UM —A stream-based concurrent object-oriented language—
inferredcites →https://doi.org/10.1016/0743-1066(86)90013-0openalex-snapshot
Login: a logic programming language with built-in inheritance
inferredcites →https://doi.org/10.1093/comjnl/33.6.494openalex-snapshot
Design of the Kernel Language for the Parallel Inference Machine
inferredcites →https://doi.org/10.1142/9789814343039_0004openalex-snapshot
INFORMATION PROCESSING
inferredcites →https://doi.org/10.1145/5001.5390openalex-snapshot
PARLOG: parallel programming in logic
inferredcites →https://doi.org/10.1145/65979.65983openalex-snapshot
Static inference of modes and data dependencies in logic programs
inferredcites →https://doi.org/10.1145/72551.72555openalex-snapshot
The family of concurrent logic programming languages

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-45309-1_27openalex-snapshot
Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_5openalex-snapshot
Resource-Passing Concurrent Programming
inferred← citeshttps://doi.org/10.1007/3-540-45628-7_7openalex-snapshot
A Pure Meta-interpreter for Flat GHC, a Concurrent Constraint Language
inferred← citeshttps://doi.org/10.1007/3-540-49481-2_5openalex-snapshot
Error-correcting Source Code
inferred← citeshttps://doi.org/10.1007/3-540-56944-8_54openalex-snapshot
Sequentialization of parallel logic programs with mode analysis
inferred← citeshttps://doi.org/10.1007/3-540-60360-3_42openalex-snapshot
Static analysis of communication for asynchronous concurrent programming languages
inferred← citeshttps://doi.org/10.1007/3-540-63875-x_58openalex-snapshot
Efficient goal scheduling in a concurrent logic language using type-based dependency analysis
inferred← citeshttps://doi.org/10.1007/978-1-4615-2690-2_16openalex-snapshot
Concurrent Logic Programs a la Mode
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_4openalex-snapshot
Concurrent Constraint Programming Research Programmes – Redux
inferred← citeshttps://doi.org/10.1007/978-3-319-29604-3_1openalex-snapshot
Logic/Constraint Programming and Concurrency: The Hard-Won Lessons of the Fifth Generation Computer Project
inferred← citeshttps://doi.org/10.1007/978-3-540-25951-0_4openalex-snapshot
Declarative Semantics of Input Consuming Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-60085-2_3openalex-snapshot
Concurrent Logic/Constraint Programming: The Next 10 Years
inferred← citeshttps://doi.org/10.1007/978-3-662-44471-9_15openalex-snapshot
Towards a Substrate Framework of Computation
inferred← citeshttps://doi.org/10.1007/bf03037485openalex-snapshot
A common intermediate language and its use in partitioning concurrent declarative programs
inferred← citeshttps://doi.org/10.1007/bf03037949openalex-snapshot
Proving termination of GHC programs
inferred← citeshttps://doi.org/10.1007/bfb0023059openalex-snapshot
Experiences with strong moding in concurrent logic/constraint programming
inferred← citeshttps://doi.org/10.1007/bfb0026579openalex-snapshot
I/O mode analysis in concurrent logic programming
inferred← citeshttps://doi.org/10.1007/bfb0026822openalex-snapshot
Modes of comprehension: Mode analysis of arrays and array comprehensions
inferred← citeshttps://doi.org/10.1016/0743-1066(94)00038-8openalex-snapshot
The deevolution of concurrent logic programming languages
inferred← citeshttps://doi.org/10.1016/j.scico.2017.06.002openalex-snapshot
Logic/Constraint Programming and Concurrency: The hard-won lessons of the Fifth Generation Computer project
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.07.009openalex-snapshot
An integrated framework for the diagnosis and correction of rule-based programs
inferred← citeshttps://doi.org/10.1016/s0096-0551(01)00005-4openalex-snapshot
Semantics of well-moded input-consuming logic programs
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00051-9openalex-snapshot
Experience with the Super Monaco optimizing compiler
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10037-7openalex-snapshot
Layered modes
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00144-6openalex-snapshot
A Generalized Deadlock-Free Process Calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80638-3openalex-snapshot
Linearity Analysis of Concurrent Logic Programs
inferred← citeshttps://doi.org/10.1017/s1471068401001326openalex-snapshot
Properties of Input-Consuming Derivations
inferred← citeshttps://doi.org/10.1023/a:1013232219911openalex-snapshot
Kima: An Automated Error Correction System for Concurrent Logic Programs
inferred← citeshttps://doi.org/10.1109/hicss.1994.323244openalex-snapshot
The Diadora principle: efficient execution of concurrent logic and related languages
inferred← citeshttps://doi.org/10.1109/icpads.1996.517574openalex-snapshot
Program Dependence Analysis of Concurrent Logic Programs and Its Applications
inferred← citeshttps://doi.org/10.1109/vl.1997.626561openalex-snapshot
Supporting design patterns in a visual parallel data-flow programming environment
inferred← citeshttps://doi.org/10.1145/1013560.1013564openalex-snapshot
Termination of simply moded logic programs with dynamic scheduling
inferred← citeshttps://doi.org/10.1145/266670.266720openalex-snapshot
Improvement of message communication in concurrent logic language
inferred← citeshttps://doi.org/10.1145/504083.504085openalex-snapshot
Parallel execution of prolog programs
inferred← citeshttps://doi.org/10.1145/952532.952738openalex-snapshot
Features of the concurrent programming language Aldwych
inferred← citeshttps://doi.org/10.22028/d291-25722openalex-snapshot
Set based failure diagnosis for concurrent constraint programming
inferred← citeshttps://doi.org/10.4230/lipics.iclp.2011.128openalex-snapshot
Minimizing the overheads of dependent {AND}-parallelism
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0012007openalex-snapshot
Kima - an Automated Error Correction System for Concurrent Logic Programs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0101023openalex-snapshot
Properties of Input-Consuming Derivations
inferred← citeshttps://doi.org/10.4995/thesis/10251/1948openalex-snapshot
Rule-Based Software Verification and Correction.
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.