On the public citation graph
Concurrent constraint programming and non-commutative logic
0 signed · 38 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.1006/inco.1995.1048openalex-snapshot
Negation and Constraint Logic Programming
inferredcites →https://doi.org/10.1006/inco.2000.3002openalex-snapshot
Linear Concurrent Constraint Programming: Operational and Phase Semantics
inferredcites →https://doi.org/10.1007/3-540-56454-3_13openalex-snapshot
The π-calculus as a theory in linear logic: Preliminary results
inferredcites →https://doi.org/10.1007/3-540-61551-2_89openalex-snapshot
Logical semantics of concurrent constraint programming
inferredcites →https://doi.org/10.1007/3-540-61739-6_35openalex-snapshot
Proving correctness of Constraint Logic Programs with dynamic scheduling
inferredcites →https://doi.org/10.1007/3-540-62688-3_43openalex-snapshot
Pomset logic: A non-commutative extension of classical linear logic
inferredcites →https://doi.org/10.1007/978-94-009-2639-4_4openalex-snapshot
Computationally Tractable Classes of Ordered Sets
inferredcites →https://doi.org/10.1007/bf03037173openalex-snapshot
Linear objects: Logical processes with built-in inheritance
inferredcites →https://doi.org/10.1016/0304-3975(92)90185-iopenalex-snapshot
The chemical abstract machine
inferredcites →https://doi.org/10.1016/0890-5401(92)90008-4openalex-snapshot
A calculus of mobile processes, I
inferredcites →https://doi.org/10.1016/0890-5401(92)90009-5openalex-snapshot
A calculus of mobile processes, II
inferredcites →https://doi.org/10.1016/s0743-1066(96)00092-1openalex-snapshot
Constructive negation by pruning
inferredcites →https://doi.org/10.1017/s0960129598002655openalex-snapshot
Concurrent programming as proof net construction
inferredcites →https://doi.org/10.1017/s107989860000826xopenalex-snapshot
The Bulletin of Symbolic Logic
inferredcites →https://doi.org/10.1080/00029890.1958.11989160openalex-snapshot
The Mathematics of Sentence Structure
inferredcites →https://doi.org/10.1090/conm/092/1003197openalex-snapshot
Towards a geometry of interaction
inferredcites →https://doi.org/10.1109/lics.1991.151657openalex-snapshot
Constructive negation for constraint logic programming
inferredcites →https://doi.org/10.1145/952980.808620openalex-snapshot
ACM doctoral dissertation award
inferredcites →https://doi.org/10.1145/99583.99627openalex-snapshot
The semantic foundations of concurrent constraint programming
inferredcites →https://doi.org/10.2307/2274953openalex-snapshot
Quantales and (noncommutative) linear logic
inferredcites →https://doi.org/10.7551/mitpress/2086.001.0001openalex-snapshot
Concurrent Constraint Programming
inferredcites →https://doi.org/10.7551/mitpress/4298.003.0047openalex-snapshot
Operational Semantics of Constraint Logic Programs with Coroutining
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2000.3002openalex-snapshot
Linear Concurrent Constraint Programming: Operational and Phase Semantics
inferred← citeshttps://doi.org/10.1007/978-3-319-06880-0_8openalex-snapshot
Leaving Traces: A Note on a Sound and Complete Trace Logic for Concurrent Constraint Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-39813-4_30openalex-snapshot
Connection-Based Proof Construction in Non-commutative Logic
inferred← citeshttps://doi.org/10.1007/s13347-019-00370-xopenalex-snapshot
Reciprocal Influences Between Proof Theory and Logic Programming
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.057openalex-snapshot
Cyclic Extensions of Order Varieties
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.08.026openalex-snapshot
On concurrent behaviors and focusing in linear logic
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)01137-0openalex-snapshot
Proof-search and Proof Nets in Mixed Linear Logic
inferred← citeshttps://doi.org/10.1017/cbo9780511550850.004openalex-snapshot
An Overview of Linear Logic Programming
inferred← citeshttps://doi.org/10.1017/s1471068421000533openalex-snapshot
A Survey of the Proof-Theoretic Foundations of Logic Programming
inferred← citeshttps://doi.org/10.1145/351268.351274openalex-snapshot
Concurrent constraint programming and linear logic (abstract)
inferred← citeshttps://doi.org/10.3233/fi-2020-1992openalex-snapshot
Dynamic Slicing for Concurrent Constraint 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.