On the public citation graph
On the asynchronous nature of communication in concurrent logic languages: A fully abstract model based on sequences
0 signed · 40 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-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-16042-6_20openalex-snapshot
Partial correctness semantics for CP[↓, ¦, &]
inferredcites →https://doi.org/10.1007/3-540-51486-4_64openalex-snapshot
Control flow versus logic: A denotational and a declarative model for Guarded Horn Clauses
inferredcites →https://doi.org/10.1007/3-540-53162-9_40openalex-snapshot
Unfolding and fixpoint semantics of concurrent constraint logic programs
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bfb0035860openalex-snapshot
A compositional semantics for Concurrent Prolog
inferredcites →https://doi.org/10.1016/s0747-7171(85)80027-4openalex-snapshot
Properties of substitutions and unifications
inferredcites →https://doi.org/10.1109/lics.1988.5130openalex-snapshot
Fully abstract denotational semantics for flat Concurrent Prolog
inferredcites →https://doi.org/10.1145/72551.72555openalex-snapshot
The family of concurrent logic programming languages
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes
inferredcites →https://doi.org/10.1145/96709.96733openalex-snapshot
Concurrent constraint programming
inferredcites →https://doi.org/10.7551/mitpress/2086.001.0001openalex-snapshot
Concurrent Constraint Programming
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/3-540-53982-4_17openalex-snapshot
A fully abstract model for concurrent constraint programming
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_18openalex-snapshot
A solved form algorithm for ask and tell Herbrand constraints
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_121openalex-snapshot
On the semantics of logic programs
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_84openalex-snapshot
The failure of failures in a paradigm for asynchronous communication
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_95openalex-snapshot
Extended Horn clauses: the framework and some semantics
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_74openalex-snapshot
On the semantics of atomized statements — the parallel-choice option —
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_25openalex-snapshot
The real-time behaviour of asynchronously communicating processes
inferred← citeshttps://doi.org/10.1007/3-540-55613-3_2openalex-snapshot
On asynchronous communication semantics
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_35openalex-snapshot
New semantic tools for logic programming
inferred← citeshttps://doi.org/10.1007/3-540-61052-9_45openalex-snapshot
A process algebra based on Linda
inferred← citeshttps://doi.org/10.1007/978-0-387-35082-0_21openalex-snapshot
Towards a calculus for generative communication
inferred← citeshttps://doi.org/10.1007/978-1-4471-3421-3_9openalex-snapshot
On the Semantics of Concurrent Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-30734-3_2openalex-snapshot
Fond (and Frank) Memories of Frank
inferred← citeshttps://doi.org/10.1007/978-3-642-14309-0_11openalex-snapshot
Concurrent and Reactive Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-37635-1_1openalex-snapshot
Open Multiparty Interaction
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/0304-3975(96)00043-6openalex-snapshot
A compositional semantic basis for the analysis of equational Horn programs
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00339-4openalex-snapshot
Linda-based applicative and imperative process algebras
inferred← citeshttps://doi.org/10.1017/s1471068410000311openalex-snapshot
Decidability properties for fragments of CHR
inferred← citeshttps://doi.org/10.1109/istcs.1993.253466openalex-snapshot
Divergence models for atomized statements and parallel choice
inferred← citeshttps://doi.org/10.1109/lics.2009.12openalex-snapshot
Trace Semantics is Fully Abstract
inferred← citeshttps://doi.org/10.1145/2370776.2370797openalex-snapshot
From the π-calculus to flat GHC
inferred← citeshttps://doi.org/10.2991/978-94-6239-067-6openalex-snapshot
Constraints Meet Concurrency
inferred← citeshttps://doi.org/10.4995/thesis/10251/55796openalex-snapshot
Análisis semántico y transformación de programas lógico-funcionales.
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.