On the public citation graph
Axiomatizing permutation equivalence in the λ-calculus
0 signed · 22 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.1016/0167-6423(90)90076-popenalex-snapshot
Communication and concurrency
inferredcites →https://doi.org/10.1016/0304-3975(89)90050-9openalex-snapshot
Concurrent transition systems
inferredcites →https://doi.org/10.1016/0304-3975(92)90087-vopenalex-snapshot
An algebraic semantics for structured transition systems and its application to logic programs
inferredcites →https://doi.org/10.1109/lics.1988.5114openalex-snapshot
Petri nets are monoids: a new algebraic foundation for net theory
inferredcites →https://doi.org/10.1109/lics.1989.39172openalex-snapshot
Axiomatizing net computations and processes
inferredcites →https://doi.org/10.1145/360248.360251openalex-snapshot
Formal verification of parallel programs
inferredcites →https://doi.org/10.3233/fi-1988-11406openalex-snapshot
A Non-Interleaving Semantics for CCS Based on Proved Transitions
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-59200-8_59openalex-snapshot
Relating two categorical models of term rewriting
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_64openalex-snapshot
Rewriting logic as a semantic framework for concurrency: a progress report
inferred← citeshttps://doi.org/10.1007/978-3-642-58622-4_10openalex-snapshot
Research Directions in Rewriting Logic
inferred← citeshttps://doi.org/10.1007/978-94-017-0464-9_1openalex-snapshot
Rewriting Logic as a Logical and Semantic Framework
inferred← citeshttps://doi.org/10.1007/bfb0014422openalex-snapshot
From abstract data types to logical frameworks
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00165-7openalex-snapshot
A causal semantics for CCS via rewriting logic
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00357-7openalex-snapshot
Rewriting logic: roadmap and bibliography
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00362-0openalex-snapshot
Comparing logics for rewriting: rewriting logic, action calculi and tile logic
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00024-6openalex-snapshot
Concurrent Semantics for the π-calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00040-4openalex-snapshot
Rewriting Logic as a Logical and Semantic Framework1 1This paper is a short version of [36], where the reader can find more examples and details not discussed here.
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80023-4openalex-snapshot
CCS Semantics via Proved Transition Systems and Rewriting Logic
inferred← citeshttps://doi.org/10.1017/s0960129500000980openalex-snapshot
Axiomatizing permutation equivalence
inferred← citeshttps://doi.org/10.1023/a:1008647417502openalex-snapshot
An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories
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.